/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-e106359-m [2022-04-15 12:54:54,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:54:54,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:54:54,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:54:54,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:54:54,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:54:54,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:54:54,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:54:54,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:54:54,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:54:54,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:54:54,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:54:54,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:54:54,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:54:54,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:54:54,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:54:54,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:54:54,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:54:54,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:54:54,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:54:54,387 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:54:54,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:54:54,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:54:54,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:54:54,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:54:54,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:54:54,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:54:54,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:54:54,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:54:54,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:54:54,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:54:54,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:54:54,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:54:54,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:54:54,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:54:54,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:54:54,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:54:54,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:54:54,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:54:54,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:54:54,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:54:54,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:54:54,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:54:54,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:54:54,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:54:54,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:54:54,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:54:54,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:54:54,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:54:54,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:54:54,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:54:54,417 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:54:54,418 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:54:54,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:54:54,418 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:54:54,418 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-15 12:54:54,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:54:54,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:54:54,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:54:54,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:54:54,654 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:54:54,655 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-15 12:54:54,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7f8b5d7/ceba5eaf9ce746d9b55d1bc34a1d5bf9/FLAG642bc53f0 [2022-04-15 12:54:55,029 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:54:55,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-15 12:54:55,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7f8b5d7/ceba5eaf9ce746d9b55d1bc34a1d5bf9/FLAG642bc53f0 [2022-04-15 12:54:55,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7f8b5d7/ceba5eaf9ce746d9b55d1bc34a1d5bf9 [2022-04-15 12:54:55,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:54:55,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:54:55,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:54:55,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:54:55,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:54:55,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20876bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55, skipping insertion in model container [2022-04-15 12:54:55,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:54:55,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:54:55,692 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-15 12:54:55,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:54:55,727 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:54:55,735 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-15 12:54:55,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:54:55,752 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:54:55,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55 WrapperNode [2022-04-15 12:54:55,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:54:55,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:54:55,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:54:55,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:54:55,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:54:55,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:54:55,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:54:55,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:54:55,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (1/1) ... [2022-04-15 12:54:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:54:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:55,809 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-15 12:54:55,832 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-15 12:54:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:54:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:54:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:54:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:54:55,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:54:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:54:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:54:55,901 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:54:55,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:54:56,083 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:54:56,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:54:56,088 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 12:54:56,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:54:56 BoogieIcfgContainer [2022-04-15 12:54:56,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:54:56,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:54:56,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:54:56,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:54:56,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:54:55" (1/3) ... [2022-04-15 12:54:56,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fd0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:54:56, skipping insertion in model container [2022-04-15 12:54:56,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:54:55" (2/3) ... [2022-04-15 12:54:56,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fd0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:54:56, skipping insertion in model container [2022-04-15 12:54:56,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:54:56" (3/3) ... [2022-04-15 12:54:56,116 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-15 12:54:56,133 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:54:56,133 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:54:56,167 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:54:56,172 INFO L340 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 [2022-04-15 12:54:56,172 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:54:56,187 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-15 12:54:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:54:56,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:56,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:56,193 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-15 12:54:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260579798] [2022-04-15 12:54:56,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:54:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-15 12:54:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:56,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268414066] [2022-04-15 12:54:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:56,441 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-15 12:54:56,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:54:56,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 12:54:56,444 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-15 12:54:56,445 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-15 12:54:56,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:54:56,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 12:54:56,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-15 12:54:56,446 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-15 12:54:56,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:54:56,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-15 12:54:56,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:54:56,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 12:54:56,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 12:54:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-15 12:54:56,448 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-15 12:54:56,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:54:56,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:54:56,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:54:56,450 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-15 12:54:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:56,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268414066] [2022-04-15 12:54:56,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268414066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:56,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:56,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:54:56,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260579798] [2022-04-15 12:54:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260579798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:56,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:56,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:54:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208308934] [2022-04-15 12:54:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:56,463 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-15 12:54:56,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:56,467 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-15 12:54:56,496 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-15 12:54:56,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:54:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:56,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:54:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:54:56,525 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-15 12:54:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:56,631 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 12:54:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:54:56,631 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-15 12:54:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:56,633 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-15 12:54:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 12:54:56,643 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-15 12:54:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 12:54:56,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 12:54:56,741 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-15 12:54:56,748 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:54:56,748 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:54:56,751 INFO L912 BasicCegarLoop]: 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-15 12:54:56,753 INFO L913 BasicCegarLoop]: 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-15 12:54:56,755 INFO L914 BasicCegarLoop]: 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-15 12:54:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:54:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:54:56,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:56,791 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-15 12:54:56,791 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-15 12:54:56,792 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-15 12:54:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:56,798 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 12:54:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:54:56,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:56,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:56,799 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-15 12:54:56,799 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-15 12:54:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:56,802 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 12:54:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:54:56,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:56,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:56,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:56,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:56,804 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-15 12:54:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-15 12:54:56,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-15 12:54:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:56,807 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-15 12:54:56,808 INFO L479 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-15 12:54:56,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-15 12:54:56,836 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-15 12:54:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 12:54:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:54:56,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:56,841 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:56,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:54:56,841 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-15 12:54:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:56,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820561752] [2022-04-15 12:54:56,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:54:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-15 12:54:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:56,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544268270] [2022-04-15 12:54:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:56,932 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-15 12:54:56,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 12:54:56,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 12:54:56,934 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-15 12:54:56,934 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-15 12:54:56,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 12:54:56,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 12:54:56,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-15 12:54:56,935 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-15 12:54:56,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-15 12:54:56,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-15 12:54:56,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-15 12:54:56,937 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-15 12:54:56,938 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-15 12:54:56,938 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-15 12:54:56,939 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-15 12:54:56,940 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-15 12:54:56,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-15 12:54:56,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-15 12:54:56,941 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-15 12:54:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:56,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544268270] [2022-04-15 12:54:56,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544268270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:56,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:56,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:54:56,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:56,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820561752] [2022-04-15 12:54:56,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820561752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:56,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:56,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:54:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995023678] [2022-04-15 12:54:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:56,944 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-15 12:54:56,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:56,945 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-15 12:54:56,959 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-15 12:54:56,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:54:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:56,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:54:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:54:56,961 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-15 12:54:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,140 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 12:54:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:54:57,140 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-15 12:54:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:57,141 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-15 12:54:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 12:54:57,142 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-15 12:54:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 12:54:57,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 12:54:57,191 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-15 12:54:57,195 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:54:57,195 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:54:57,195 INFO L912 BasicCegarLoop]: 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-15 12:54:57,199 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 12:54:57,200 INFO L914 BasicCegarLoop]: 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-15 12:54:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:54:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:54:57,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:57,215 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-15 12:54:57,215 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-15 12:54:57,216 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-15 12:54:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,221 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-15 12:54:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 12:54:57,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,222 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-15 12:54:57,222 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-15 12:54:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,223 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-15 12:54:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 12:54:57,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:57,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:57,224 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-15 12:54:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-15 12:54:57,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-15 12:54:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:57,226 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-15 12:54:57,226 INFO L479 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-15 12:54:57,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-15 12:54:57,276 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-15 12:54:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 12:54:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:54:57,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:57,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:57,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:54:57,278 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:57,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-15 12:54:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:57,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428319707] [2022-04-15 12:54:57,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:54:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-15 12:54:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:57,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641826098] [2022-04-15 12:54:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:57,334 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-15 12:54:57,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-15 12:54:57,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-15 12:54:57,339 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-15 12:54:57,339 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-15 12:54:57,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-15 12:54:57,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-15 12:54:57,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-15 12:54:57,340 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-15 12:54:57,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-15 12:54:57,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-15 12:54:57,343 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-15 12:54:57,343 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-15 12:54:57,344 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-15 12:54:57,346 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-15 12:54:57,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-15 12:54:57,347 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-15 12:54:57,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-15 12:54:57,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-15 12:54:57,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-15 12:54:57,348 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-15 12:54:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:57,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641826098] [2022-04-15 12:54:57,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641826098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:57,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:57,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:54:57,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:57,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1428319707] [2022-04-15 12:54:57,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1428319707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:57,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:57,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:54:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297915615] [2022-04-15 12:54:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:57,350 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-15 12:54:57,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:57,350 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-15 12:54:57,369 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-15 12:54:57,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:54:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:54:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:54:57,370 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-15 12:54:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,482 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 12:54:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:54:57,482 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-15 12:54:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:57,483 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-15 12:54:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:54:57,484 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-15 12:54:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 12:54:57,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 12:54:57,520 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-15 12:54:57,521 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:54:57,521 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:54:57,522 INFO L912 BasicCegarLoop]: 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-15 12:54:57,523 INFO L913 BasicCegarLoop]: 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-15 12:54:57,523 INFO L914 BasicCegarLoop]: 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-15 12:54:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:54:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:54:57,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:57,537 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-15 12:54:57,537 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-15 12:54:57,537 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-15 12:54:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,539 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 12:54:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 12:54:57,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,540 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-15 12:54:57,540 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-15 12:54:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,541 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 12:54:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 12:54:57,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:57,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:57,542 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-15 12:54:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-15 12:54:57,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-15 12:54:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:57,544 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-15 12:54:57,544 INFO L479 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-15 12:54:57,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-15 12:54:57,585 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-15 12:54:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 12:54:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:54:57,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:57,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:57,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:54:57,586 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-15 12:54:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:57,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825597438] [2022-04-15 12:54:57,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:54:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-15 12:54:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:57,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086992322] [2022-04-15 12:54:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:57,631 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-15 12:54:57,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-15 12:54:57,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-15 12:54:57,632 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-15 12:54:57,633 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-15 12:54:57,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-15 12:54:57,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-15 12:54:57,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-15 12:54:57,634 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-15 12:54:57,634 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-15 12:54:57,635 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-15 12:54:57,635 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-15 12:54:57,636 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-15 12:54:57,637 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-15 12:54:57,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-15 12:54:57,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-15 12:54:57,637 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-15 12:54:57,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-15 12:54:57,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-15 12:54:57,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-15 12:54:57,638 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-15 12:54:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086992322] [2022-04-15 12:54:57,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086992322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:57,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:57,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:54:57,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:57,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825597438] [2022-04-15 12:54:57,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825597438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:57,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:57,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:54:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010960474] [2022-04-15 12:54:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:57,640 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-15 12:54:57,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:57,641 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-15 12:54:57,657 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-15 12:54:57,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:54:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:54:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:54:57,659 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-15 12:54:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,772 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-15 12:54:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:54:57,773 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-15 12:54:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:57,773 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-15 12:54:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 12:54:57,777 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-15 12:54:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 12:54:57,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-15 12:54:57,817 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-15 12:54:57,821 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:54:57,821 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:54:57,823 INFO L912 BasicCegarLoop]: 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-15 12:54:57,824 INFO L913 BasicCegarLoop]: 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-15 12:54:57,826 INFO L914 BasicCegarLoop]: 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-15 12:54:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:54:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:54:57,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:57,853 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-15 12:54:57,854 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-15 12:54:57,854 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-15 12:54:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,856 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 12:54:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 12:54:57,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,857 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-15 12:54:57,857 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-15 12:54:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:57,861 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 12:54:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 12:54:57,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:57,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:57,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:57,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:57,866 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-15 12:54:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-15 12:54:57,867 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-15 12:54:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:57,867 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-15 12:54:57,867 INFO L479 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-15 12:54:57,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-15 12:54:57,911 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-15 12:54:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 12:54:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:54:57,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:57,914 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:57,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:54:57,914 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:57,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:57,915 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-15 12:54:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:57,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285781924] [2022-04-15 12:54:58,102 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1460958083, now seen corresponding path program 1 times [2022-04-15 12:54:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:58,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274886201] [2022-04-15 12:54:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:58,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(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-15 12:54:58,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-15 12:54:58,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-15 12:54:58,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:58,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(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-15 12:54:58,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-15 12:54:58,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-15 12:54:58,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-15 12:54:58,282 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-15 12:54:58,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:54:58,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:54:58,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:58,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} [86] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:58,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:58,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 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; {784#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:54:58,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 12:54:58,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 12:54:58,292 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-15 12:54:58,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-15 12:54:58,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-15 12:54:58,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-15 12:54:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:58,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274886201] [2022-04-15 12:54:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274886201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603618947] [2022-04-15 12:54:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:58,301 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-15 12:54:58,307 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-15 12:54:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:58,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:54:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:58,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:09,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2022-04-15 12:55:09,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#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); {775#true} is VALID [2022-04-15 12:55:09,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-15 12:55:09,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-15 12:55:09,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-15 12:55:09,976 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-15 12:55:09,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:55:09,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:55:09,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {813#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:10,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {813#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} [86] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {817#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:10,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {817#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {817#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:10,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {817#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~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; {776#false} is VALID [2022-04-15 12:55:10,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#false} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 12:55:10,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 12:55:10,182 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-15 12:55:10,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-15 12:55:10,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-15 12:55:10,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-15 12:55:10,183 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-15 12:55:10,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:55:10,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603618947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:10,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:55:10,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2022-04-15 12:55:10,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285781924] [2022-04-15 12:55:10,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285781924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:10,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:10,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:55:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071211885] [2022-04-15 12:55:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-15 12:55:10,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:10,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 12:55:10,484 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-15 12:55:10,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:55:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:55:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:55:10,485 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 12:55:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:10,683 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-15 12:55:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:55:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-15 12:55:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 12:55:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 12:55:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 12:55:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 12:55:10,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-15 12:55:10,828 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-15 12:55:10,828 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:55:10,829 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:55:10,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:10,829 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:10,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-04-15 12:55:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:55:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:55:10,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:10,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:10,869 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:10,869 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:10,870 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 12:55:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 12:55:10,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:10,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:10,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:55:10,871 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:55:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:10,872 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 12:55:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 12:55:10,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:10,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:10,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:10,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-15 12:55:10,874 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2022-04-15 12:55:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:10,874 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-15 12:55:10,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 12:55:10,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-15 12:55:10,942 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-15 12:55:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 12:55:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:55:10,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:10,944 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:10,961 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-15 12:55:11,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:11,149 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1840537200, now seen corresponding path program 2 times [2022-04-15 12:55:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:11,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507547583] [2022-04-15 12:55:11,352 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1747989443, now seen corresponding path program 1 times [2022-04-15 12:55:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861903211] [2022-04-15 12:55:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:11,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1071#(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); {1061#true} is VALID [2022-04-15 12:55:11,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 12:55:11,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #83#return; {1061#true} is VALID [2022-04-15 12:55:11,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:11,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#(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); {1061#true} is VALID [2022-04-15 12:55:11,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 12:55:11,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #83#return; {1061#true} is VALID [2022-04-15 12:55:11,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret15 := main(); {1061#true} is VALID [2022-04-15 12:55:11,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1066#(= main_~y~0 0)} is VALID [2022-04-15 12:55:11,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {1067#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:55:11,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1068#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:55:11,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [89] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~z~0_In_2 v_main_~z~0_Out_4)) (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= |v_main_#t~post7_Out_4| 0) (= (+ v_main_~x~0_Out_4 v_main_~z~0_Out_4) (+ v_main_~z~0_In_2 v_main_~x~0_In_2)) (= |v_main_#t~post8_Out_4| 0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_4, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:11,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} [88] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:11,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:11,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(<= (+ main_~x~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (* (div (+ main_~x~0 4294967294 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 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; {1070#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:11,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {1070#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1062#false} is VALID [2022-04-15 12:55:11,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1062#false} assume !(~z~0 % 4294967296 > 0); {1062#false} is VALID [2022-04-15 12:55:11,491 INFO L272 TraceCheckUtils]: 14: Hoare triple {1062#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1062#false} is VALID [2022-04-15 12:55:11,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1062#false} ~cond := #in~cond; {1062#false} is VALID [2022-04-15 12:55:11,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#false} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 12:55:11,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 12:55:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:11,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861903211] [2022-04-15 12:55:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861903211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315707070] [2022-04-15 12:55:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:11,493 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-15 12:55:11,494 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-15 12:55:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:55:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:11,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:20,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-15 12:55:20,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#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); {1061#true} is VALID [2022-04-15 12:55:20,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 12:55:20,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #83#return; {1061#true} is VALID [2022-04-15 12:55:20,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret15 := main(); {1061#true} is VALID [2022-04-15 12:55:20,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1066#(= main_~y~0 0)} is VALID [2022-04-15 12:55:20,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {1067#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:55:20,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1068#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:55:20,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [89] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~z~0_In_2 v_main_~z~0_Out_4)) (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= |v_main_#t~post7_Out_4| 0) (= (+ v_main_~x~0_Out_4 v_main_~z~0_Out_4) (+ v_main_~z~0_In_2 v_main_~x~0_In_2)) (= |v_main_#t~post8_Out_4| 0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_4, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1099#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:20,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(and (<= main_~z~0 0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) (* (- 1) main_~x~0)) (- 4294967296)) (div (+ main_~z~0 main_~x~0) 4294967296)))} [88] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {1103#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:20,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {1103#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1103#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:20,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(<= (div (* main_~x~0 (- 4294967295)) (- 4294967296)) (div (* main_~x~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; {1062#false} is VALID [2022-04-15 12:55:20,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#false} assume !(~x~0 % 4294967296 > 0); {1062#false} is VALID [2022-04-15 12:55:20,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {1062#false} assume !(~z~0 % 4294967296 > 0); {1062#false} is VALID [2022-04-15 12:55:20,485 INFO L272 TraceCheckUtils]: 14: Hoare triple {1062#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1062#false} is VALID [2022-04-15 12:55:20,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1062#false} ~cond := #in~cond; {1062#false} is VALID [2022-04-15 12:55:20,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#false} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 12:55:20,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 12:55:20,486 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-15 12:55:20,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:55:20,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315707070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:20,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:55:20,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2022-04-15 12:55:20,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:20,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507547583] [2022-04-15 12:55:20,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507547583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:20,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:20,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622416559] [2022-04-15 12:55:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 19 [2022-04-15 12:55:20,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:20,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-15 12:55:20,905 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-15 12:55:20,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:20,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:20,906 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-15 12:55:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:21,460 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 12:55:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:21,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 19 [2022-04-15 12:55:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-15 12:55:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:55:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-15 12:55:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:55:21,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:55:21,565 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-15 12:55:21,566 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:55:21,566 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:55:21,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:55:21,567 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:21,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-04-15 12:55:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:55:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:55:21,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:21,584 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-15 12:55:21,585 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-15 12:55:21,585 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-15 12:55:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:21,586 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-15 12:55:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 12:55:21,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:21,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:21,587 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-15 12:55:21,587 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-15 12:55:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:21,588 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-15 12:55:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 12:55:21,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:21,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:21,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:21,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:21,588 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-15 12:55:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-15 12:55:21,589 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-04-15 12:55:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:21,590 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-15 12:55:21,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-15 12:55:21,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-15 12:55:21,635 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-15 12:55:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 12:55:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:55:21,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:21,635 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:21,655 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-15 12:55:21,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 12:55:21,844 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-15 12:55:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:21,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541293306] [2022-04-15 12:55:22,013 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash 603383854, now seen corresponding path program 1 times [2022-04-15 12:55:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:22,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79399314] [2022-04-15 12:55:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {1333#(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); {1326#true} is VALID [2022-04-15 12:55:22,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-15 12:55:22,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1326#true} {1326#true} #83#return; {1326#true} is VALID [2022-04-15 12:55:22,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:22,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#(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); {1326#true} is VALID [2022-04-15 12:55:22,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-15 12:55:22,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #83#return; {1326#true} is VALID [2022-04-15 12:55:22,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret15 := main(); {1326#true} is VALID [2022-04-15 12:55:22,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1326#true} is VALID [2022-04-15 12:55:22,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} [91] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_1 v_main_~y~0_Out_2) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= 0 |v_main_#t~post6_Out_2|) (= (+ v_main_~x~0_In_3 v_main_~y~0_In_1) (+ v_main_~x~0_Out_6 v_main_~y~0_Out_2)) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= |v_main_#t~post5_Out_2| 0) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1326#true} is VALID [2022-04-15 12:55:22,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1326#true} is VALID [2022-04-15 12:55:22,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {1326#true} ~z~0 := ~y~0; {1331#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:22,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {1331#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1332#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:22,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1332#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1327#false} is VALID [2022-04-15 12:55:22,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {1327#false} assume !(~y~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-15 12:55:22,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {1327#false} assume !(~x~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-15 12:55:22,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {1327#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; {1327#false} is VALID [2022-04-15 12:55:22,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {1327#false} assume !(~z~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-15 12:55:22,105 INFO L272 TraceCheckUtils]: 15: Hoare triple {1327#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1327#false} is VALID [2022-04-15 12:55:22,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-15 12:55:22,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-15 12:55:22,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-15 12:55:22,105 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-15 12:55:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:22,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79399314] [2022-04-15 12:55:22,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79399314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:22,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:22,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:22,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541293306] [2022-04-15 12:55:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541293306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:55:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602420372] [2022-04-15 12:55:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:22,131 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-15 12:55:22,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:22,131 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-15 12:55:22,145 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-15 12:55:22,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:55:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:55:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:55:22,146 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-15 12:55:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:22,309 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 12:55:22,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:55:22,310 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-15 12:55:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:22,310 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-15 12:55:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:55:22,311 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-15 12:55:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 12:55:22,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 12:55:22,359 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-15 12:55:22,361 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:55:22,361 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:55:22,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:55:22,362 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:22,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:55:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:55:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:55:22,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:22,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:22,383 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:22,383 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:22,384 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 12:55:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:55:22,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:22,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:22,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:55:22,386 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:55:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:22,388 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 12:55:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:55:22,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:22,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:22,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:22,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 12:55:22,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-15 12:55:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:22,389 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 12:55:22,389 INFO L479 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-15 12:55:22,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 12:55:22,444 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-15 12:55:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:55:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:55:22,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:22,445 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:22,445 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:55:22,445 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-04-15 12:55:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:22,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201333546] [2022-04-15 12:55:22,618 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -988351090, now seen corresponding path program 1 times [2022-04-15 12:55:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:22,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074955196] [2022-04-15 12:55:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(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); {1514#true} is VALID [2022-04-15 12:55:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-15 12:55:22,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #83#return; {1514#true} is VALID [2022-04-15 12:55:22,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(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); {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #83#return; {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret15 := main(); {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {1514#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1514#true} is VALID [2022-04-15 12:55:22,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 12:55:22,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} ~z~0 := ~y~0; {1519#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:22,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1519#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:22,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {1515#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; {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {1515#false} assume !(~x~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {1515#false} assume !(~z~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L272 TraceCheckUtils]: 15: Hoare triple {1515#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {1515#false} ~cond := #in~cond; {1515#false} is VALID [2022-04-15 12:55:22,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {1515#false} assume 0 == ~cond; {1515#false} is VALID [2022-04-15 12:55:22,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-15 12:55:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074955196] [2022-04-15 12:55:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074955196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288160216] [2022-04-15 12:55:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:22,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:22,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:22,676 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-15 12:55:22,678 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-15 12:55:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:55:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:22,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:22,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-15 12:55:22,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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); {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #83#return; {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret15 := main(); {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {1514#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1514#true} is VALID [2022-04-15 12:55:22,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 12:55:22,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} ~z~0 := ~y~0; {1519#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:22,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1519#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:22,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:22,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {1515#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; {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {1515#false} assume !(~x~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {1515#false} assume !(~z~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L272 TraceCheckUtils]: 15: Hoare triple {1515#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1515#false} ~cond := #in~cond; {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1515#false} assume 0 == ~cond; {1515#false} is VALID [2022-04-15 12:55:22,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-15 12:55:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:22,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:23,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1515#false} assume 0 == ~cond; {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1515#false} ~cond := #in~cond; {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L272 TraceCheckUtils]: 15: Hoare triple {1515#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1515#false} assume !(~z~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {1515#false} assume !(~x~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:23,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1515#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; {1515#false} is VALID [2022-04-15 12:55:23,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1515#false} is VALID [2022-04-15 12:55:23,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:23,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1520#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:23,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} ~z~0 := ~y~0; {1606#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:55:23,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {1514#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret15 := main(); {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #83#return; {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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); {1514#true} is VALID [2022-04-15 12:55:23,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-15 12:55:23,212 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-15 12:55:23,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288160216] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:23,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:55:23,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 6 [2022-04-15 12:55:23,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:23,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201333546] [2022-04-15 12:55:23,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201333546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:23,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:55:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776347240] [2022-04-15 12:55:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 19 [2022-04-15 12:55:23,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:23,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-15 12:55:23,246 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-15 12:55:23,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:55:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:55:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:55:23,246 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-15 12:55:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:23,365 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 12:55:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:55:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 19 [2022-04-15 12:55:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-15 12:55:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 12:55:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-15 12:55:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 12:55:23,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-15 12:55:23,400 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-15 12:55:23,401 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:55:23,401 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:55:23,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:55:23,402 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:23,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:55:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:55:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:55:23,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:23,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:23,421 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:23,421 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:23,423 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:55:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:55:23,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:23,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:23,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:55:23,424 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:55:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:23,424 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:55:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:55:23,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:23,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:23,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:23,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 12:55:23,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2022-04-15 12:55:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:23,425 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 12:55:23,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-15 12:55:23,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 12:55:23,465 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-15 12:55:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:55:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:55:23,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:23,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:23,491 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-15 12:55:23,666 WARN L460 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-15 12:55:23,667 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-15 12:55:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:23,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106656181] [2022-04-15 12:55:23,832 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1655786916, now seen corresponding path program 1 times [2022-04-15 12:55:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401239276] [2022-04-15 12:55:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:23,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {1797#(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); {1787#true} is VALID [2022-04-15 12:55:23,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-15 12:55:23,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-15 12:55:23,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:23,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1797#(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); {1787#true} is VALID [2022-04-15 12:55:23,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-15 12:55:23,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-15 12:55:23,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret15 := main(); {1787#true} is VALID [2022-04-15 12:55:23,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1792#(= main_~y~0 0)} is VALID [2022-04-15 12:55:23,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#(= main_~y~0 0)} [95] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1793#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:55:23,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1793#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:55:23,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {1794#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:55:23,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {1794#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1795#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 12:55:23,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {1795#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {1795#(and (not (= main_~y~0 0)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 12:55:23,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {1795#(and (not (= main_~y~0 0)) (<= (+ (* 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; {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:23,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:23,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {1788#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; {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {1788#false} assume !(~z~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L272 TraceCheckUtils]: 16: Hoare triple {1788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {1788#false} ~cond := #in~cond; {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {1788#false} assume 0 == ~cond; {1788#false} is VALID [2022-04-15 12:55:23,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-15 12:55:23,967 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-15 12:55:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401239276] [2022-04-15 12:55:23,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401239276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142845745] [2022-04-15 12:55:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:23,969 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-15 12:55:23,969 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-15 12:55:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:24,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:55:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:24,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:24,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-15 12:55:24,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#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); {1787#true} is VALID [2022-04-15 12:55:24,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-15 12:55:24,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-15 12:55:24,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret15 := main(); {1787#true} is VALID [2022-04-15 12:55:24,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1787#true} is VALID [2022-04-15 12:55:24,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {1787#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1787#true} is VALID [2022-04-15 12:55:24,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1822#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:24,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1822#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {1822#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:24,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#(not (< 0 (mod 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; {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:24,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:24,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:24,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:24,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:24,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {1788#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; {1788#false} is VALID [2022-04-15 12:55:24,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1788#false} assume !(~z~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:24,289 INFO L272 TraceCheckUtils]: 16: Hoare triple {1788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1788#false} is VALID [2022-04-15 12:55:24,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1788#false} ~cond := #in~cond; {1788#false} is VALID [2022-04-15 12:55:24,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {1788#false} assume 0 == ~cond; {1788#false} is VALID [2022-04-15 12:55:24,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-15 12:55:24,289 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-15 12:55:24,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:24,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-15 12:55:24,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {1788#false} assume 0 == ~cond; {1788#false} is VALID [2022-04-15 12:55:24,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {1788#false} ~cond := #in~cond; {1788#false} is VALID [2022-04-15 12:55:24,488 INFO L272 TraceCheckUtils]: 16: Hoare triple {1788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1788#false} is VALID [2022-04-15 12:55:24,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1788#false} assume !(~z~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:24,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1788#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; {1788#false} is VALID [2022-04-15 12:55:24,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1788#false} is VALID [2022-04-15 12:55:24,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:24,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(<= (+ (* 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; {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:24,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:24,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#(<= (* (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; {1796#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:24,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1890#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1890#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:55:24,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1890#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:55:24,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {1787#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1787#true} is VALID [2022-04-15 12:55:24,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1787#true} is VALID [2022-04-15 12:55:24,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret15 := main(); {1787#true} is VALID [2022-04-15 12:55:24,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-15 12:55:24,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-15 12:55:24,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#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); {1787#true} is VALID [2022-04-15 12:55:24,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-15 12:55:24,493 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-15 12:55:24,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142845745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:24,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:24,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-04-15 12:55:24,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:24,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106656181] [2022-04-15 12:55:24,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106656181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:24,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:24,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:55:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912087088] [2022-04-15 12:55:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:24,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,605 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-15 12:55:24,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:55:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:55:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:24,606 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:24,984 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 12:55:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:55:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 12:55:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 12:55:24,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-15 12:55:25,036 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-15 12:55:25,037 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:55:25,037 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:55:25,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:55:25,038 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:25,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:55:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-15 12:55:25,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:25,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:25,068 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:25,068 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:25,069 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 12:55:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 12:55:25,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:25,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:25,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 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-15 12:55:25,069 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 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-15 12:55:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:25,070 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 12:55:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 12:55:25,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:25,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:25,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:25,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-04-15 12:55:25,072 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 20 [2022-04-15 12:55:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:25,072 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-04-15 12:55:25,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-15 12:55:25,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 33 transitions. [2022-04-15 12:55:25,138 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-15 12:55:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 12:55:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:55:25,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:25,139 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:25,164 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-15 12:55:25,339 WARN L460 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-15 12:55:25,340 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-15 12:55:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104165289] [2022-04-15 12:55:25,477 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1460692051, now seen corresponding path program 1 times [2022-04-15 12:55:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:25,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585032309] [2022-04-15 12:55:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:25,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {2119#(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); {2112#true} is VALID [2022-04-15 12:55:25,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2112#true} assume true; {2112#true} is VALID [2022-04-15 12:55:25,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2112#true} {2112#true} #83#return; {2112#true} is VALID [2022-04-15 12:55:25,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:25,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2119#(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); {2112#true} is VALID [2022-04-15 12:55:25,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2022-04-15 12:55:25,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #83#return; {2112#true} is VALID [2022-04-15 12:55:25,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret15 := main(); {2112#true} is VALID [2022-04-15 12:55:25,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2112#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2112#true} is VALID [2022-04-15 12:55:25,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2112#true} is VALID [2022-04-15 12:55:25,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2112#true} is VALID [2022-04-15 12:55:25,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {2112#true} ~z~0 := ~y~0; {2112#true} is VALID [2022-04-15 12:55:25,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {2112#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; {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2113#false} is VALID [2022-04-15 12:55:25,542 INFO L272 TraceCheckUtils]: 16: Hoare triple {2113#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2113#false} is VALID [2022-04-15 12:55:25,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#false} ~cond := #in~cond; {2113#false} is VALID [2022-04-15 12:55:25,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {2113#false} assume 0 == ~cond; {2113#false} is VALID [2022-04-15 12:55:25,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2022-04-15 12:55:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:25,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585032309] [2022-04-15 12:55:25,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585032309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:25,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195145465] [2022-04-15 12:55:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:25,544 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-15 12:55:25,567 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-15 12:55:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:25,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:55:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:25,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:25,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2022-04-15 12:55:25,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2112#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); {2112#true} is VALID [2022-04-15 12:55:25,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2022-04-15 12:55:25,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #83#return; {2112#true} is VALID [2022-04-15 12:55:25,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret15 := main(); {2112#true} is VALID [2022-04-15 12:55:25,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {2112#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2112#true} is VALID [2022-04-15 12:55:25,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2112#true} is VALID [2022-04-15 12:55:25,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2112#true} is VALID [2022-04-15 12:55:25,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2112#true} ~z~0 := ~y~0; {2112#true} is VALID [2022-04-15 12:55:25,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {2112#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; {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2113#false} is VALID [2022-04-15 12:55:25,780 INFO L272 TraceCheckUtils]: 16: Hoare triple {2113#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2113#false} is VALID [2022-04-15 12:55:25,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#false} ~cond := #in~cond; {2113#false} is VALID [2022-04-15 12:55:25,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {2113#false} assume 0 == ~cond; {2113#false} is VALID [2022-04-15 12:55:25,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2022-04-15 12:55:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:25,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:25,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2022-04-15 12:55:25,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {2113#false} assume 0 == ~cond; {2113#false} is VALID [2022-04-15 12:55:25,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#false} ~cond := #in~cond; {2113#false} is VALID [2022-04-15 12:55:25,983 INFO L272 TraceCheckUtils]: 16: Hoare triple {2113#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2113#false} is VALID [2022-04-15 12:55:25,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2113#false} is VALID [2022-04-15 12:55:25,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2118#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 12:55:25,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {2112#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; {2117#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:25,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {2112#true} ~z~0 := ~y~0; {2112#true} is VALID [2022-04-15 12:55:25,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {2112#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret15 := main(); {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #83#return; {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {2112#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); {2112#true} is VALID [2022-04-15 12:55:25,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2022-04-15 12:55:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195145465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:25,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 12:55:26,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:26,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104165289] [2022-04-15 12:55:26,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104165289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:26,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:26,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:55:26,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812314629] [2022-04-15 12:55:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:26,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:26,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,038 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-15 12:55:26,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:55:26,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:26,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:55:26,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:55:26,039 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:26,288 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-15 12:55:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:26,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:55:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:55:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:55:26,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-15 12:55:26,357 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-15 12:55:26,357 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:55:26,357 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:55:26,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:55:26,358 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:26,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:55:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-15 12:55:26,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:26,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,403 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,403 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:26,404 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 12:55:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 12:55:26,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:26,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:26,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 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 34 states. [2022-04-15 12:55:26,405 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 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 34 states. [2022-04-15 12:55:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:26,406 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 12:55:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 12:55:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:26,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:26,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:26,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-15 12:55:26,407 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-15 12:55:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:26,407 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-15 12:55:26,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:26,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-15 12:55:26,474 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-15 12:55:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:55:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:55:26,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:26,475 INFO L499 BasicCegarLoop]: 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-15 12:55:26,490 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-15 12:55:26,675 WARN L460 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-15 12:55:26,675 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-15 12:55:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:26,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706375573] [2022-04-15 12:55:26,827 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash 75294800, now seen corresponding path program 1 times [2022-04-15 12:55:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:26,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605045629] [2022-04-15 12:55:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:26,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {2469#(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); {2457#true} is VALID [2022-04-15 12:55:26,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {2457#true} assume true; {2457#true} is VALID [2022-04-15 12:55:26,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2457#true} {2457#true} #83#return; {2457#true} is VALID [2022-04-15 12:55:26,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2457#true} call ULTIMATE.init(); {2469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:26,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2469#(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); {2457#true} is VALID [2022-04-15 12:55:26,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2457#true} assume true; {2457#true} is VALID [2022-04-15 12:55:26,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2457#true} {2457#true} #83#return; {2457#true} is VALID [2022-04-15 12:55:26,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {2457#true} call #t~ret15 := main(); {2457#true} is VALID [2022-04-15 12:55:26,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {2457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2457#true} is VALID [2022-04-15 12:55:26,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {2457#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2457#true} is VALID [2022-04-15 12:55:26,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {2457#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2457#true} is VALID [2022-04-15 12:55:26,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {2457#true} ~z~0 := ~y~0; {2462#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:26,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {2462#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2463#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:26,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2463#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2464#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:55:27,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {2464#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~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; {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2467#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:55:27,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {2467#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2468#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:55:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2458#false} is VALID [2022-04-15 12:55:27,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#false} assume !false; {2458#false} is VALID [2022-04-15 12:55:27,010 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-15 12:55:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605045629] [2022-04-15 12:55:27,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605045629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620386340] [2022-04-15 12:55:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:27,011 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-15 12:55:27,013 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-15 12:55:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:27,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:55:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:27,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:27,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {2457#true} call ULTIMATE.init(); {2457#true} is VALID [2022-04-15 12:55:27,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {2457#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); {2457#true} is VALID [2022-04-15 12:55:27,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2457#true} assume true; {2457#true} is VALID [2022-04-15 12:55:27,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2457#true} {2457#true} #83#return; {2457#true} is VALID [2022-04-15 12:55:27,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {2457#true} call #t~ret15 := main(); {2457#true} is VALID [2022-04-15 12:55:27,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {2457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2457#true} is VALID [2022-04-15 12:55:27,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {2457#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2457#true} is VALID [2022-04-15 12:55:27,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {2457#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2457#true} is VALID [2022-04-15 12:55:27,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {2457#true} ~z~0 := ~y~0; {2462#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:27,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {2462#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2457#true} is VALID [2022-04-15 12:55:27,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#true} assume !(~z~0 % 4294967296 > 0); {2457#true} is VALID [2022-04-15 12:55:27,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {2457#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; {2457#true} is VALID [2022-04-15 12:55:27,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {2457#true} assume !(~y~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~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; {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:27,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:27,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {2528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2458#false} is VALID [2022-04-15 12:55:27,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#false} assume !false; {2458#false} is VALID [2022-04-15 12:55:27,293 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-15 12:55:27,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:27,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#false} assume !false; {2458#false} is VALID [2022-04-15 12:55:27,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {2528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2458#false} is VALID [2022-04-15 12:55:27,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:27,408 INFO L272 TraceCheckUtils]: 17: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:27,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(<= main_~y~0 (* (div main_~y~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; {2466#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {2457#true} assume !(~y~0 % 4294967296 > 0); {2465#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2457#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; {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#true} assume !(~z~0 % 4294967296 > 0); {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {2457#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; {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {2457#true} ~z~0 := ~y~0; {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {2457#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {2457#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2457#true} is VALID [2022-04-15 12:55:27,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {2457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {2457#true} call #t~ret15 := main(); {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2457#true} {2457#true} #83#return; {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2457#true} assume true; {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2457#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); {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {2457#true} call ULTIMATE.init(); {2457#true} is VALID [2022-04-15 12:55:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:55:27,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620386340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:27,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:27,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 12 [2022-04-15 12:55:27,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:27,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706375573] [2022-04-15 12:55:27,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706375573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:27,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:27,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:55:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033040497] [2022-04-15 12:55:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:27,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:27,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:27,463 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-15 12:55:27,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:55:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:55:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:27,464 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:28,181 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-04-15 12:55:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:55:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 12:55:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 12:55:28,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 12:55:28,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:28,253 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:55:28,253 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:55:28,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:55:28,254 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:28,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:55:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 12:55:28,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:28,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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-15 12:55:28,322 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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-15 12:55:28,322 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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-15 12:55:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:28,323 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 12:55:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 12:55:28,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:28,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:28,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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 40 states. [2022-04-15 12:55:28,324 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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 40 states. [2022-04-15 12:55:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:28,325 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 12:55:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 12:55:28,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:28,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:28,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:28,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 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-15 12:55:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-04-15 12:55:28,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 21 [2022-04-15 12:55:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:28,326 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-04-15 12:55:28,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-15 12:55:28,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 50 transitions. [2022-04-15 12:55:28,429 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-15 12:55:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-04-15 12:55:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:55:28,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:28,430 INFO L499 BasicCegarLoop]: 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-15 12:55:28,445 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-15 12:55:28,630 WARN L460 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-15 12:55:28,631 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-04-15 12:55:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:28,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883466471] [2022-04-15 12:55:28,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 67701875, now seen corresponding path program 1 times [2022-04-15 12:55:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:28,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249098020] [2022-04-15 12:55:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:28,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2900#(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); {2893#true} is VALID [2022-04-15 12:55:28,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2893#true} assume true; {2893#true} is VALID [2022-04-15 12:55:28,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2893#true} {2893#true} #83#return; {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {2893#true} call ULTIMATE.init(); {2900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#(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); {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2893#true} assume true; {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2893#true} {2893#true} #83#return; {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {2893#true} call #t~ret15 := main(); {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {2893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {2893#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {2893#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2893#true} is VALID [2022-04-15 12:55:28,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#true} ~z~0 := ~y~0; {2893#true} is VALID [2022-04-15 12:55:28,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {2893#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; {2893#true} is VALID [2022-04-15 12:55:28,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {2893#true} assume !(~z~0 % 4294967296 > 0); {2898#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:28,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {2898#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:28,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~y~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:28,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:28,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:28,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {2898#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:28,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {2898#(<= 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; {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {2894#false} assume !(~z~0 % 4294967296 > 0); {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L272 TraceCheckUtils]: 18: Hoare triple {2894#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {2894#false} ~cond := #in~cond; {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#false} assume 0 == ~cond; {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#false} assume !false; {2894#false} is VALID [2022-04-15 12:55:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:55:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:28,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249098020] [2022-04-15 12:55:28,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249098020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:28,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810335642] [2022-04-15 12:55:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:28,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:28,842 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-15 12:55:28,843 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-15 12:55:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:28,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:55:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:28,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:29,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {2893#true} call ULTIMATE.init(); {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {2893#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); {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {2893#true} assume true; {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2893#true} {2893#true} #83#return; {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {2893#true} call #t~ret15 := main(); {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {2893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {2893#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2893#true} is VALID [2022-04-15 12:55:29,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {2893#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2893#true} is VALID [2022-04-15 12:55:29,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#true} ~z~0 := ~y~0; {2928#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:29,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2928#(= 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; {2932#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:29,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {2932#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:29,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#(= 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; {2939#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 12:55:29,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {2939#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {2898#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {2898#(<= 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; {2894#false} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {2894#false} assume !(~z~0 % 4294967296 > 0); {2894#false} is VALID [2022-04-15 12:55:29,106 INFO L272 TraceCheckUtils]: 18: Hoare triple {2894#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2894#false} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {2894#false} ~cond := #in~cond; {2894#false} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#false} assume 0 == ~cond; {2894#false} is VALID [2022-04-15 12:55:29,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#false} assume !false; {2894#false} is VALID [2022-04-15 12:55:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:29,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:29,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#false} assume !false; {2894#false} is VALID [2022-04-15 12:55:29,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#false} assume 0 == ~cond; {2894#false} is VALID [2022-04-15 12:55:29,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {2894#false} ~cond := #in~cond; {2894#false} is VALID [2022-04-15 12:55:29,412 INFO L272 TraceCheckUtils]: 18: Hoare triple {2894#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2894#false} is VALID [2022-04-15 12:55:29,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {2894#false} assume !(~z~0 % 4294967296 > 0); {2894#false} is VALID [2022-04-15 12:55:29,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {2898#(<= 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; {2894#false} is VALID [2022-04-15 12:55:29,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {2898#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:29,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2899#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:29,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {3001#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2997#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:29,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {3001#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3001#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:29,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {3008#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {3001#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#true} ~z~0 := ~y~0; {3008#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {2893#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {2893#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {2893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {2893#true} call #t~ret15 := main(); {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2893#true} {2893#true} #83#return; {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {2893#true} assume true; {2893#true} is VALID [2022-04-15 12:55:29,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {2893#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); {2893#true} is VALID [2022-04-15 12:55:29,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {2893#true} call ULTIMATE.init(); {2893#true} is VALID [2022-04-15 12:55:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:29,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810335642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:29,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:29,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2022-04-15 12:55:29,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883466471] [2022-04-15 12:55:29,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883466471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:29,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:29,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:55:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658928772] [2022-04-15 12:55:29,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:29,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,490 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-15 12:55:29,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:55:29,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:29,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:55:29,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:55:29,491 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:29,858 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-15 12:55:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:55:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:55:29,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:55:29,908 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-15 12:55:29,909 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:55:29,909 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:55:29,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:55:29,910 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:29,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:55:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:55:30,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:30,001 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-15 12:55:30,001 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-15 12:55:30,001 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-15 12:55:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:30,002 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-15 12:55:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-15 12:55:30,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:30,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:30,002 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-15 12:55:30,002 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-15 12:55:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:30,003 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-15 12:55:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-15 12:55:30,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:30,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:30,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:30,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:30,004 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-15 12:55:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-15 12:55:30,005 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 22 [2022-04-15 12:55:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:30,005 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-04-15 12:55:30,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:30,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-15 12:55:30,151 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-15 12:55:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-15 12:55:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:55:30,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:30,152 INFO L499 BasicCegarLoop]: 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-15 12:55:30,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:30,352 WARN L460 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-15 12:55:30,353 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-04-15 12:55:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:30,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632278486] [2022-04-15 12:55:30,489 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1695222748, now seen corresponding path program 1 times [2022-04-15 12:55:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:30,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160118583] [2022-04-15 12:55:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:30,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {3301#(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); {3294#true} is VALID [2022-04-15 12:55:30,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:55:30,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3294#true} {3294#true} #83#return; {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:30,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {3301#(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); {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #83#return; {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret15 := main(); {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3294#true} is VALID [2022-04-15 12:55:30,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3294#true} is VALID [2022-04-15 12:55:30,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {3294#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {3300#(<= 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; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3299#(<= 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; {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {3295#false} assume !(~x~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {3295#false} assume !(~z~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L272 TraceCheckUtils]: 18: Hoare triple {3295#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#false} ~cond := #in~cond; {3295#false} is VALID [2022-04-15 12:55:30,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#false} assume 0 == ~cond; {3295#false} is VALID [2022-04-15 12:55:30,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-04-15 12:55:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:55:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160118583] [2022-04-15 12:55:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160118583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242972749] [2022-04-15 12:55:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:30,582 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-15 12:55:30,591 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-15 12:55:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:30,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:55:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:30,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:30,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3294#true} is VALID [2022-04-15 12:55:30,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#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); {3294#true} is VALID [2022-04-15 12:55:30,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:55:30,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #83#return; {3294#true} is VALID [2022-04-15 12:55:30,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret15 := main(); {3294#true} is VALID [2022-04-15 12:55:30,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3294#true} is VALID [2022-04-15 12:55:30,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3294#true} is VALID [2022-04-15 12:55:30,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {3294#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:30,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {3300#(<= 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; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:30,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {3299#(<= 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; {3295#false} is VALID [2022-04-15 12:55:30,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {3295#false} assume !(~x~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:30,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3295#false} is VALID [2022-04-15 12:55:30,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {3295#false} assume !(~z~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:30,911 INFO L272 TraceCheckUtils]: 18: Hoare triple {3295#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3295#false} is VALID [2022-04-15 12:55:30,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#false} ~cond := #in~cond; {3295#false} is VALID [2022-04-15 12:55:30,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#false} assume 0 == ~cond; {3295#false} is VALID [2022-04-15 12:55:30,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-04-15 12:55:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:55:30,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#false} assume 0 == ~cond; {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#false} ~cond := #in~cond; {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L272 TraceCheckUtils]: 18: Hoare triple {3295#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {3295#false} assume !(~z~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3295#false} is VALID [2022-04-15 12:55:31,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {3295#false} assume !(~x~0 % 4294967296 > 0); {3295#false} is VALID [2022-04-15 12:55:31,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {3299#(<= 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; {3295#false} is VALID [2022-04-15 12:55:31,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {3300#(<= 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; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:31,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:31,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:31,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:31,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(<= 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; {3300#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:31,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:31,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {3294#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3299#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:31,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3294#true} is VALID [2022-04-15 12:55:31,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3294#true} is VALID [2022-04-15 12:55:31,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret15 := main(); {3294#true} is VALID [2022-04-15 12:55:31,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #83#return; {3294#true} is VALID [2022-04-15 12:55:31,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:55:31,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#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); {3294#true} is VALID [2022-04-15 12:55:31,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3294#true} is VALID [2022-04-15 12:55:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:55:31,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242972749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:31,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:31,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 12:55:31,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:31,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1632278486] [2022-04-15 12:55:31,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1632278486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:31,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:31,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:55:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989962653] [2022-04-15 12:55:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:31,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,173 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-15 12:55:31,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:55:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:55:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:55:31,174 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:31,457 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 12:55:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:55:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 12:55:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 12:55:31,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 12:55:31,503 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-15 12:55:31,504 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:55:31,504 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:55:31,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:55:31,505 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:31,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:55:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-15 12:55:31,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:31,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:31,561 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:31,561 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:31,562 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 12:55:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-15 12:55:31,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:31,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:31,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:55:31,562 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:55:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:31,563 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 12:55:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-15 12:55:31,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:31,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:31,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:31,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 12:55:31,564 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 22 [2022-04-15 12:55:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:31,565 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 12:55:31,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-15 12:55:31,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 12:55:31,702 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-15 12:55:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 12:55:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:55:31,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:31,703 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:31,719 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-15 12:55:31,907 WARN L460 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-15 12:55:31,907 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1891906146, now seen corresponding path program 2 times [2022-04-15 12:55:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280165490] [2022-04-15 12:55:32,009 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 251419950, now seen corresponding path program 1 times [2022-04-15 12:55:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:32,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801904275] [2022-04-15 12:55:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:32,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {3695#(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); {3686#true} is VALID [2022-04-15 12:55:32,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-15 12:55:32,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3686#true} {3686#true} #83#return; {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {3686#true} call ULTIMATE.init(); {3695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:32,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {3695#(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); {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3686#true} {3686#true} #83#return; {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {3686#true} call #t~ret15 := main(); {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {3686#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {3686#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3686#true} is VALID [2022-04-15 12:55:32,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {3686#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3686#true} is VALID [2022-04-15 12:55:32,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {3686#true} ~z~0 := ~y~0; {3691#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:32,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {3691#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3692#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:32,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3692#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:32,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {3687#false} assume !(~x~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {3687#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; {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {3687#false} assume !(~z~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L272 TraceCheckUtils]: 17: Hoare triple {3687#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {3687#false} ~cond := #in~cond; {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {3687#false} assume 0 == ~cond; {3687#false} is VALID [2022-04-15 12:55:32,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {3687#false} assume !false; {3687#false} is VALID [2022-04-15 12:55:32,111 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-15 12:55:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801904275] [2022-04-15 12:55:32,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801904275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:32,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844362569] [2022-04-15 12:55:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:32,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:32,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:32,113 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-15 12:55:32,128 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-15 12:55:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:32,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:55:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:32,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:32,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {3686#true} call ULTIMATE.init(); {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {3686#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); {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3686#true} {3686#true} #83#return; {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {3686#true} call #t~ret15 := main(); {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {3686#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {3686#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {3686#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3686#true} is VALID [2022-04-15 12:55:32,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {3686#true} ~z~0 := ~y~0; {3691#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:32,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {3691#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3692#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:32,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {3692#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:32,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {3687#false} assume !(~x~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {3687#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; {3687#false} is VALID [2022-04-15 12:55:32,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {3687#false} assume !(~z~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,460 INFO L272 TraceCheckUtils]: 17: Hoare triple {3687#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3687#false} is VALID [2022-04-15 12:55:32,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {3687#false} ~cond := #in~cond; {3687#false} is VALID [2022-04-15 12:55:32,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {3687#false} assume 0 == ~cond; {3687#false} is VALID [2022-04-15 12:55:32,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {3687#false} assume !false; {3687#false} is VALID [2022-04-15 12:55:32,460 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-15 12:55:32,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:32,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {3687#false} assume !false; {3687#false} is VALID [2022-04-15 12:55:32,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {3687#false} assume 0 == ~cond; {3687#false} is VALID [2022-04-15 12:55:32,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {3687#false} ~cond := #in~cond; {3687#false} is VALID [2022-04-15 12:55:32,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {3687#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3687#false} is VALID [2022-04-15 12:55:32,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {3687#false} assume !(~z~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {3687#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; {3687#false} is VALID [2022-04-15 12:55:32,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {3687#false} assume !(~x~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3687#false} is VALID [2022-04-15 12:55:32,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3694#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:32,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {3789#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3693#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:32,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {3789#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {3686#true} ~z~0 := ~y~0; {3793#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {3686#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {3686#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {3686#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {3686#true} call #t~ret15 := main(); {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3686#true} {3686#true} #83#return; {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {3686#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); {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {3686#true} call ULTIMATE.init(); {3686#true} is VALID [2022-04-15 12:55:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:32,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844362569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:32,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:32,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:55:32,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280165490] [2022-04-15 12:55:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280165490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:32,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:32,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:55:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359192309] [2022-04-15 12:55:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:32,730 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-15 12:55:32,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:32,730 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-15 12:55:32,752 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-15 12:55:32,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:55:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:32,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:55:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:55:32,752 INFO L87 Difference]: Start difference. First operand 32 states and 42 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-15 12:55:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:33,346 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 12:55:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:55:33,346 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-15 12:55:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:33,346 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-15 12:55:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-15 12:55:33,347 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-15 12:55:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-15 12:55:33,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-15 12:55:33,410 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-15 12:55:33,411 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:55:33,411 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:55:33,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:55:33,412 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:33,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:55:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-15 12:55:33,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:33,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:33,472 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:33,472 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:33,472 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 12:55:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 12:55:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:33,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:33,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:55:33,473 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:55:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:33,473 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 12:55:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 12:55:33,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:33,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:33,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:33,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-04-15 12:55:33,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2022-04-15 12:55:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:33,475 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-04-15 12:55:33,475 INFO L479 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-15 12:55:33,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 34 transitions. [2022-04-15 12:55:33,555 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-15 12:55:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-04-15 12:55:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:55:33,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:33,556 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:33,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:33,756 WARN L460 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-15 12:55:33,757 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 3 times [2022-04-15 12:55:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:33,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855925966] [2022-04-15 12:55:33,886 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1268982133, now seen corresponding path program 1 times [2022-04-15 12:55:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:33,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486499055] [2022-04-15 12:55:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:33,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4047#(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); {4039#true} is VALID [2022-04-15 12:55:33,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:55:33,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4039#true} {4039#true} #83#return; {4039#true} is VALID [2022-04-15 12:55:33,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:33,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4047#(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); {4039#true} is VALID [2022-04-15 12:55:33,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:55:33,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #83#return; {4039#true} is VALID [2022-04-15 12:55:33,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret15 := main(); {4039#true} is VALID [2022-04-15 12:55:33,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4039#true} is VALID [2022-04-15 12:55:33,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4039#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4039#true} is VALID [2022-04-15 12:55:33,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {4039#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4044#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:33,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {4044#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4044#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:33,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {4044#(<= 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; {4045#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} is VALID [2022-04-15 12:55:33,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {4045#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 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; {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:33,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:33,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {4046#(<= (+ (* 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; {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:33,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {4046#(<= (+ (* 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; {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:33,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:55:33,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {4046#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4040#false} is VALID [2022-04-15 12:55:33,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {4040#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; {4040#false} is VALID [2022-04-15 12:55:33,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {4040#false} assume !(~z~0 % 4294967296 > 0); {4040#false} is VALID [2022-04-15 12:55:33,974 INFO L272 TraceCheckUtils]: 18: Hoare triple {4040#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4040#false} is VALID [2022-04-15 12:55:33,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#false} ~cond := #in~cond; {4040#false} is VALID [2022-04-15 12:55:33,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#false} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:55:33,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:55:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:55:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:33,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486499055] [2022-04-15 12:55:33,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486499055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:33,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917805171] [2022-04-15 12:55:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:33,977 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-15 12:55:34,007 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-15 12:55:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:55:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:34,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:34,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#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); {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #83#return; {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret15 := main(); {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {4039#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {4039#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {4039#true} ~z~0 := ~y~0; {4039#true} is VALID [2022-04-15 12:55:34,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {4039#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; {4039#true} is VALID [2022-04-15 12:55:34,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {4039#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; {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:34,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:34,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {4081#(< 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; {4088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:34,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {4088#(< 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; {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(< 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; {4088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:34,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {4088#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4040#false} is VALID [2022-04-15 12:55:34,146 INFO L272 TraceCheckUtils]: 18: Hoare triple {4040#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4040#false} is VALID [2022-04-15 12:55:34,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#false} ~cond := #in~cond; {4040#false} is VALID [2022-04-15 12:55:34,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#false} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:55:34,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:55:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:34,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:34,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:55:34,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {4040#false} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:55:34,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {4040#false} ~cond := #in~cond; {4040#false} is VALID [2022-04-15 12:55:34,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {4040#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4040#false} is VALID [2022-04-15 12:55:34,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {4088#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4040#false} is VALID [2022-04-15 12:55:34,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(< 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; {4088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:34,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {4088#(< 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; {4092#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 12:55:34,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {4081#(< 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; {4088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:34,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {4039#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; {4081#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {4039#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; {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {4039#true} ~z~0 := ~y~0; {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {4039#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {4039#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret15 := main(); {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #83#return; {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:55:34,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#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); {4039#true} is VALID [2022-04-15 12:55:34,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2022-04-15 12:55:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:34,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917805171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:34,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:34,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-15 12:55:34,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855925966] [2022-04-15 12:55:34,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855925966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:34,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:34,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87916298] [2022-04-15 12:55:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:55:34,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:34,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-15 12:55:34,322 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-15 12:55:34,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:34,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:34,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:55:34,323 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-15 12:55:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,823 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-15 12:55:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:55:34,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:55:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-15 12:55:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 12:55:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-15 12:55:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 12:55:34,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-15 12:55:34,893 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-15 12:55:34,895 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:55:34,895 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:55:34,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:55:34,896 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:34,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:55:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-15 12:55:34,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:34,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 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-15 12:55:34,967 INFO L74 IsIncluded]: Start isIncluded. First operand 43 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-15 12:55:34,967 INFO L87 Difference]: Start difference. First operand 43 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-15 12:55:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,968 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-15 12:55:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-15 12:55:34,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:34,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:34,969 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 43 states. [2022-04-15 12:55:34,969 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 43 states. [2022-04-15 12:55:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:34,969 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-15 12:55:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-15 12:55:34,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:34,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:34,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:34,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:34,970 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-15 12:55:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 12:55:34,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 23 [2022-04-15 12:55:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:34,970 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-15 12:55:34,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-15 12:55:34,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-15 12:55:35,076 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-15 12:55:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 12:55:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:55:35,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:35,077 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:35,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 12:55:35,277 WARN L460 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-15 12:55:35,278 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 2 times [2022-04-15 12:55:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:35,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404531686] [2022-04-15 12:55:35,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 370878500, now seen corresponding path program 1 times [2022-04-15 12:55:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:35,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699622971] [2022-04-15 12:55:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:35,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {4462#(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); {4452#true} is VALID [2022-04-15 12:55:35,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#true} assume true; {4452#true} is VALID [2022-04-15 12:55:35,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4452#true} {4452#true} #83#return; {4452#true} is VALID [2022-04-15 12:55:35,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} call ULTIMATE.init(); {4462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:35,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {4462#(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); {4452#true} is VALID [2022-04-15 12:55:35,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} assume true; {4452#true} is VALID [2022-04-15 12:55:35,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} #83#return; {4452#true} is VALID [2022-04-15 12:55:35,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} call #t~ret15 := main(); {4452#true} is VALID [2022-04-15 12:55:35,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4457#(= main_~y~0 0)} is VALID [2022-04-15 12:55:35,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {4457#(= main_~y~0 0)} [109] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4458#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:55:35,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4458#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:55:35,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {4459#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:55:35,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {4459#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 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; {4460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {4460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {4461#(<= main_~x~0 (+ 4294967296 (* (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; {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {4461#(<= main_~x~0 (+ 4294967296 (* (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; {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4461#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {4461#(<= main_~x~0 (+ 4294967296 (* (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; {4460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:35,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {4460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4453#false} is VALID [2022-04-15 12:55:35,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {4453#false} assume !(~z~0 % 4294967296 > 0); {4453#false} is VALID [2022-04-15 12:55:35,562 INFO L272 TraceCheckUtils]: 18: Hoare triple {4453#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4453#false} is VALID [2022-04-15 12:55:35,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {4453#false} ~cond := #in~cond; {4453#false} is VALID [2022-04-15 12:55:35,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {4453#false} assume 0 == ~cond; {4453#false} is VALID [2022-04-15 12:55:35,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {4453#false} assume !false; {4453#false} is VALID [2022-04-15 12:55:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:35,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699622971] [2022-04-15 12:55:35,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699622971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:35,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890614276] [2022-04-15 12:55:35,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:35,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:35,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:35,564 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-15 12:55:35,593 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-15 12:55:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:35,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:55:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:35,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:35,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} call ULTIMATE.init(); {4452#true} is VALID [2022-04-15 12:55:35,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#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); {4452#true} is VALID [2022-04-15 12:55:35,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} assume true; {4452#true} is VALID [2022-04-15 12:55:35,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} #83#return; {4452#true} is VALID [2022-04-15 12:55:35,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} call #t~ret15 := main(); {4452#true} is VALID [2022-04-15 12:55:35,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4452#true} is VALID [2022-04-15 12:55:35,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {4452#true} [109] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4452#true} is VALID [2022-04-15 12:55:35,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {4452#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-15 12:55:35,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {4452#true} ~z~0 := ~y~0; {4452#true} is VALID [2022-04-15 12:55:35,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {4452#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; {4493#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:35,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {4493#(< 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; {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:35,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:35,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#(< 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; {4493#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:35,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {4493#(< 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; {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#(< 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; {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4453#false} is VALID [2022-04-15 12:55:35,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {4453#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4453#false} is VALID [2022-04-15 12:55:35,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {4453#false} ~cond := #in~cond; {4453#false} is VALID [2022-04-15 12:55:35,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {4453#false} assume 0 == ~cond; {4453#false} is VALID [2022-04-15 12:55:35,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {4453#false} assume !false; {4453#false} is VALID [2022-04-15 12:55:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:35,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:35,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {4453#false} assume !false; {4453#false} is VALID [2022-04-15 12:55:35,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {4453#false} assume 0 == ~cond; {4453#false} is VALID [2022-04-15 12:55:35,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {4453#false} ~cond := #in~cond; {4453#false} is VALID [2022-04-15 12:55:35,778 INFO L272 TraceCheckUtils]: 18: Hoare triple {4453#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4453#false} is VALID [2022-04-15 12:55:35,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4453#false} is VALID [2022-04-15 12:55:35,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#(< 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; {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {4493#(< 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; {4507#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:35,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#(< 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; {4493#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:35,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:35,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {4493#(< 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; {4497#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:35,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {4452#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; {4493#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:35,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {4452#true} ~z~0 := ~y~0; {4452#true} is VALID [2022-04-15 12:55:35,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {4452#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {4452#true} [109] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} call #t~ret15 := main(); {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} #83#return; {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} assume true; {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#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); {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} call ULTIMATE.init(); {4452#true} is VALID [2022-04-15 12:55:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:35,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890614276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:35,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:35,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-04-15 12:55:35,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:35,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404531686] [2022-04-15 12:55:35,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404531686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:35,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:35,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:55:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426510111] [2022-04-15 12:55:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:35,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:55:35,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:35,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:35,930 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-15 12:55:35,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:55:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:55:35,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:55:35,931 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:36,740 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-15 12:55:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:55:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:55:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 12:55:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 12:55:36,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-04-15 12:55:36,813 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-15 12:55:36,814 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:55:36,814 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:55:36,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:55:36,815 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:36,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:55:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-04-15 12:55:36,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:36,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,933 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,933 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:36,934 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 12:55:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 12:55:36,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:36,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:36,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 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 43 states. [2022-04-15 12:55:36,934 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 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 43 states. [2022-04-15 12:55:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:36,935 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 12:55:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 12:55:36,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:36,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:36,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:36,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-15 12:55:36,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2022-04-15 12:55:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:36,937 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-04-15 12:55:36,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:36,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2022-04-15 12:55:37,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-15 12:55:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:55:37,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:37,098 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:37,114 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-15 12:55:37,299 WARN L460 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-15 12:55:37,299 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 3 times [2022-04-15 12:55:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:37,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [48429302] [2022-04-15 12:55:37,433 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1735206158, now seen corresponding path program 1 times [2022-04-15 12:55:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042990402] [2022-04-15 12:55:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:37,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {4893#(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); {4884#true} is VALID [2022-04-15 12:55:37,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 12:55:37,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4884#true} {4884#true} #83#return; {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4893#(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); {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #83#return; {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret15 := main(); {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {4884#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {4884#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4884#true} is VALID [2022-04-15 12:55:37,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {4884#true} ~z~0 := ~y~0; {4884#true} is VALID [2022-04-15 12:55:37,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {4884#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; {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:37,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {4890#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:37,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {4890#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4890#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:37,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {4890#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4891#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:55:37,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {4891#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) 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; {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:55:37,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:55:37,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) 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; {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:55:37,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) 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; {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:55:37,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:55:37,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {4892#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {4885#false} is VALID [2022-04-15 12:55:37,528 INFO L272 TraceCheckUtils]: 19: Hoare triple {4885#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4885#false} is VALID [2022-04-15 12:55:37,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {4885#false} ~cond := #in~cond; {4885#false} is VALID [2022-04-15 12:55:37,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {4885#false} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 12:55:37,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 12:55:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042990402] [2022-04-15 12:55:37,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042990402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497509554] [2022-04-15 12:55:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:37,532 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-15 12:55:37,550 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-15 12:55:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:37,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:55:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:37,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:37,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-15 12:55:37,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#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); {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #83#return; {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret15 := main(); {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {4884#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4884#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4884#true} is VALID [2022-04-15 12:55:37,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {4884#true} ~z~0 := ~y~0; {4921#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:37,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {4921#(= 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; {4925#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:55:37,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {4925#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {4929#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:37,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {4929#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4929#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:37,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {4929#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 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; {4936#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 12:55:37,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {4936#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~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; {4940#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:55:37,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4940#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:55:37,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 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; {4947#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-15 12:55:37,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {4947#(and (< 0 (mod main_~z~0 4294967296)) (= 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; {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {4951#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4885#false} is VALID [2022-04-15 12:55:37,814 INFO L272 TraceCheckUtils]: 19: Hoare triple {4885#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4885#false} is VALID [2022-04-15 12:55:37,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {4885#false} ~cond := #in~cond; {4885#false} is VALID [2022-04-15 12:55:37,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {4885#false} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 12:55:37,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 12:55:37,814 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-15 12:55:37,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:37,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 12:55:37,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {4885#false} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 12:55:37,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {4885#false} ~cond := #in~cond; {4885#false} is VALID [2022-04-15 12:55:37,919 INFO L272 TraceCheckUtils]: 19: Hoare triple {4885#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4885#false} is VALID [2022-04-15 12:55:37,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {4951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4885#false} is VALID [2022-04-15 12:55:37,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {4951#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {4951#(< 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; {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(< 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; {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:37,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {5000#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:37,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {5000#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {5000#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:37,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {5000#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:55:37,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {4884#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; {4889#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:37,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {4884#true} ~z~0 := ~y~0; {4884#true} is VALID [2022-04-15 12:55:37,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {4884#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4884#true} is VALID [2022-04-15 12:55:37,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {4884#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4884#true} is VALID [2022-04-15 12:55:37,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret15 := main(); {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #83#return; {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#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); {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-15 12:55:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:37,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497509554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:37,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:37,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 5] total 15 [2022-04-15 12:55:37,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:37,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [48429302] [2022-04-15 12:55:37,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [48429302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:37,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:37,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:55:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510707607] [2022-04-15 12:55:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:55:37,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:37,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-15 12:55:38,023 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-15 12:55:38,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:55:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:55:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:55:38,024 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-15 12:55:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:38,876 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-15 12:55:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:55:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:55:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-15 12:55:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 12:55:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-15 12:55:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 12:55:38,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-15 12:55:38,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:38,954 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:55:38,954 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:55:38,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:55:38,955 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:38,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:55:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:55:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-04-15 12:55:39,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:39,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,108 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,109 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,110 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-04-15 12:55:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-04-15 12:55:39,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:39,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:39,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 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 56 states. [2022-04-15 12:55:39,110 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 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 56 states. [2022-04-15 12:55:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:39,111 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-04-15 12:55:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-04-15 12:55:39,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:39,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:39,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:39,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-04-15 12:55:39,113 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-04-15 12:55:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:39,113 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-04-15 12:55:39,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-15 12:55:39,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 62 transitions. [2022-04-15 12:55:39,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-04-15 12:55:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:55:39,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:39,346 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:39,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 12:55:39,546 WARN L460 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-15 12:55:39,546 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 4 times [2022-04-15 12:55:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:39,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430879388] [2022-04-15 12:55:39,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1735658773, now seen corresponding path program 1 times [2022-04-15 12:55:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:39,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169758642] [2022-04-15 12:55:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {5401#(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); {5390#true} is VALID [2022-04-15 12:55:39,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {5390#true} assume true; {5390#true} is VALID [2022-04-15 12:55:39,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5390#true} {5390#true} #83#return; {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {5390#true} call ULTIMATE.init(); {5401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {5401#(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); {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {5390#true} assume true; {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5390#true} {5390#true} #83#return; {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {5390#true} call #t~ret15 := main(); {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {5390#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {5390#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {5390#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5390#true} is VALID [2022-04-15 12:55:39,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {5390#true} ~z~0 := ~y~0; {5395#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:39,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {5395#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5396#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:39,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {5396#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5397#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:39,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {5397#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5398#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:55:39,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {5398#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:39,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#false} assume !(~y~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#false} assume !(~x~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {5391#false} assume !(~z~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L272 TraceCheckUtils]: 20: Hoare triple {5391#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {5391#false} ~cond := #in~cond; {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {5391#false} assume 0 == ~cond; {5391#false} is VALID [2022-04-15 12:55:39,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {5391#false} assume !false; {5391#false} is VALID [2022-04-15 12:55:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:39,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169758642] [2022-04-15 12:55:39,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169758642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:39,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081607167] [2022-04-15 12:55:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:39,813 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-15 12:55:39,814 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-15 12:55:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:55:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:39,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:40,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {5390#true} call ULTIMATE.init(); {5390#true} is VALID [2022-04-15 12:55:40,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {5390#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); {5390#true} is VALID [2022-04-15 12:55:40,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {5390#true} assume true; {5390#true} is VALID [2022-04-15 12:55:40,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5390#true} {5390#true} #83#return; {5390#true} is VALID [2022-04-15 12:55:40,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {5390#true} call #t~ret15 := main(); {5390#true} is VALID [2022-04-15 12:55:40,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {5390#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5390#true} is VALID [2022-04-15 12:55:40,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {5390#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5390#true} is VALID [2022-04-15 12:55:40,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {5390#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5390#true} is VALID [2022-04-15 12:55:40,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {5390#true} ~z~0 := ~y~0; {5395#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:55:40,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {5395#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5396#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:40,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {5396#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5397#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:40,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {5397#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5438#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:55:40,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {5438#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:40,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#false} assume !(~y~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#false} assume !(~x~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {5391#false} assume !(~z~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L272 TraceCheckUtils]: 20: Hoare triple {5391#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {5391#false} ~cond := #in~cond; {5391#false} is VALID [2022-04-15 12:55:40,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {5391#false} assume 0 == ~cond; {5391#false} is VALID [2022-04-15 12:55:40,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {5391#false} assume !false; {5391#false} is VALID [2022-04-15 12:55:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:40,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {5391#false} assume !false; {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {5391#false} assume 0 == ~cond; {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {5391#false} ~cond := #in~cond; {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L272 TraceCheckUtils]: 20: Hoare triple {5391#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {5391#false} assume !(~z~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#false} assume !(~x~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:40,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#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; {5391#false} is VALID [2022-04-15 12:55:40,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#false} assume !(~y~0 % 4294967296 > 0); {5391#false} is VALID [2022-04-15 12:55:40,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5391#false} is VALID [2022-04-15 12:55:40,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5400#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:40,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {5438#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5399#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:40,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {5511#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5438#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:55:40,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {5515#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5511#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:55:40,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {5519#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5515#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {5390#true} ~z~0 := ~y~0; {5519#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {5390#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {5390#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {5390#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {5390#true} call #t~ret15 := main(); {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5390#true} {5390#true} #83#return; {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {5390#true} assume true; {5390#true} is VALID [2022-04-15 12:55:40,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {5390#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); {5390#true} is VALID [2022-04-15 12:55:40,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {5390#true} call ULTIMATE.init(); {5390#true} is VALID [2022-04-15 12:55:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:40,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081607167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:40,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:40,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 12:55:40,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:40,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430879388] [2022-04-15 12:55:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430879388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:40,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:40,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:55:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352064704] [2022-04-15 12:55:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:40,815 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 25 [2022-04-15 12:55:40,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:40,816 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-15 12:55:40,837 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-15 12:55:40,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:55:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:55:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:55:40,838 INFO L87 Difference]: Start difference. First operand 46 states and 62 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-15 12:55:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:41,884 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2022-04-15 12:55:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:55:41,885 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 25 [2022-04-15 12:55:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:41,885 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-15 12:55:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-15 12:55:41,886 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-15 12:55:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-15 12:55:41,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-15 12:55:41,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:41,953 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:55:41,953 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:55:41,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:55:41,954 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:41,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:55:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:55:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-04-15 12:55:42,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:42,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,131 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,132 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:42,133 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 12:55:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 12:55:42,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:42,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:42,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 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 56 states. [2022-04-15 12:55:42,135 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 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 56 states. [2022-04-15 12:55:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:42,136 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 12:55:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 12:55:42,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:42,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:42,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:42,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-15 12:55:42,137 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 25 [2022-04-15 12:55:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:42,137 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-15 12:55:42,137 INFO L479 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-15 12:55:42,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-15 12:55:42,368 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-15 12:55:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 12:55:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:55:42,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:42,368 INFO L499 BasicCegarLoop]: 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-15 12:55:42,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 12:55:42,571 WARN L460 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-15 12:55:42,571 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 4 times [2022-04-15 12:55:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:42,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50556268] [2022-04-15 12:55:42,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash -881559186, now seen corresponding path program 1 times [2022-04-15 12:55:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:42,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040192371] [2022-04-15 12:55:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {5929#(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); {5915#true} is VALID [2022-04-15 12:55:42,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {5915#true} assume true; {5915#true} is VALID [2022-04-15 12:55:42,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5915#true} {5915#true} #83#return; {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {5915#true} call ULTIMATE.init(); {5929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:42,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {5929#(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); {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {5915#true} assume true; {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5915#true} {5915#true} #83#return; {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {5915#true} call #t~ret15 := main(); {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {5915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {5915#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5915#true} is VALID [2022-04-15 12:55:42,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {5915#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5915#true} is VALID [2022-04-15 12:55:42,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#true} ~z~0 := ~y~0; {5920#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:42,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {5920#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5921#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:42,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {5921#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5922#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:42,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {5922#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5923#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:55:42,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {5923#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:42,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:42,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:42,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:42,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:42,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:42,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:42,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:42,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:42,876 INFO L272 TraceCheckUtils]: 21: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:55:42,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {5927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:55:42,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {5928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5916#false} is VALID [2022-04-15 12:55:42,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {5916#false} assume !false; {5916#false} is VALID [2022-04-15 12:55:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:42,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:42,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040192371] [2022-04-15 12:55:42,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040192371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:42,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305981879] [2022-04-15 12:55:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:42,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:42,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:42,880 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-15 12:55:42,908 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-15 12:55:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:55:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:42,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:43,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {5915#true} call ULTIMATE.init(); {5915#true} is VALID [2022-04-15 12:55:43,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {5915#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); {5915#true} is VALID [2022-04-15 12:55:43,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {5915#true} assume true; {5915#true} is VALID [2022-04-15 12:55:43,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5915#true} {5915#true} #83#return; {5915#true} is VALID [2022-04-15 12:55:43,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {5915#true} call #t~ret15 := main(); {5915#true} is VALID [2022-04-15 12:55:43,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {5915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5915#true} is VALID [2022-04-15 12:55:43,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {5915#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5915#true} is VALID [2022-04-15 12:55:43,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {5915#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5915#true} is VALID [2022-04-15 12:55:43,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#true} ~z~0 := ~y~0; {5920#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:43,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {5920#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5921#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:43,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {5921#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5915#true} is VALID [2022-04-15 12:55:43,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {5915#true} assume !(~z~0 % 4294967296 > 0); {5915#true} is VALID [2022-04-15 12:55:43,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#true} assume !(~y~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:43,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:43,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:43,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:43,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,204 INFO L272 TraceCheckUtils]: 21: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:43,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {5996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:43,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {6000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5916#false} is VALID [2022-04-15 12:55:43,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {5916#false} assume !false; {5916#false} is VALID [2022-04-15 12:55:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:43,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:43,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {5916#false} assume !false; {5916#false} is VALID [2022-04-15 12:55:43,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {6000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5916#false} is VALID [2022-04-15 12:55:43,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {5996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:43,341 INFO L272 TraceCheckUtils]: 21: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:43,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:43,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:43,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {5926#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:43,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {5925#(<= main_~y~0 (* (div main_~y~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; {5924#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#true} assume !(~y~0 % 4294967296 > 0); {5925#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {5915#true} assume !(~z~0 % 4294967296 > 0); {5915#true} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {5915#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; {5915#true} is VALID [2022-04-15 12:55:43,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#true} ~z~0 := ~y~0; {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {5915#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {5915#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {5915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {5915#true} call #t~ret15 := main(); {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5915#true} {5915#true} #83#return; {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {5915#true} assume true; {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {5915#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); {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {5915#true} call ULTIMATE.init(); {5915#true} is VALID [2022-04-15 12:55:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:43,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305981879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:43,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 14 [2022-04-15 12:55:43,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50556268] [2022-04-15 12:55:43,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50556268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:43,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:43,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:55:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861424994] [2022-04-15 12:55:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:43,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:43,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:43,459 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-15 12:55:43,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:55:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:55:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:55:43,460 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,071 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2022-04-15 12:55:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:55:45,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-15 12:55:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-15 12:55:45,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2022-04-15 12:55:45,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:45,186 INFO L225 Difference]: With dead ends: 105 [2022-04-15 12:55:45,186 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:55:45,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:55:45,187 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:45,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 67 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:55:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:55:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2022-04-15 12:55:45,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:45,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,432 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,432 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,434 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-15 12:55:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-15 12:55:45,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:45,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:45,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 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 69 states. [2022-04-15 12:55:45,434 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 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 69 states. [2022-04-15 12:55:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:45,435 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-15 12:55:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-15 12:55:45,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:45,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:45,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:45,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-15 12:55:45,437 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 26 [2022-04-15 12:55:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:45,437 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-15 12:55:45,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) 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-15 12:55:45,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 83 transitions. [2022-04-15 12:55:45,784 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-15 12:55:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-15 12:55:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:55:45,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:45,785 INFO L499 BasicCegarLoop]: 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-15 12:55:45,801 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-15 12:55:45,987 WARN L460 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-15 12:55:45,987 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 5 times [2022-04-15 12:55:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:45,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450170333] [2022-04-15 12:55:46,098 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 264339221, now seen corresponding path program 1 times [2022-04-15 12:55:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:46,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137570550] [2022-04-15 12:55:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {6594#(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-15 12:55:46,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-15 12:55:46,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {6594#(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-15 12:55:46,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-15 12:55:46,178 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; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {6586#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {6586#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {6586#true} ~z~0 := ~y~0; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {6586#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; {6586#true} is VALID [2022-04-15 12:55:46,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {6586#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; {6586#true} is VALID [2022-04-15 12:55:46,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {6586#true} assume !(~z~0 % 4294967296 > 0); {6591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:46,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {6591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:46,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:46,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {6591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:46,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {6591#(<= 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; {6587#false} is VALID [2022-04-15 12:55:46,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-15 12:55:46,193 INFO L272 TraceCheckUtils]: 22: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-15 12:55:46,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-15 12:55:46,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-15 12:55:46,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-15 12:55:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137570550] [2022-04-15 12:55:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137570550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150131561] [2022-04-15 12:55:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:46,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:46,199 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-15 12:55:46,203 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-15 12:55:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:55:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:46,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:46,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-15 12:55:46,495 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-15 12:55:46,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-15 12:55:46,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-15 12:55:46,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-15 12:55:46,496 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; {6586#true} is VALID [2022-04-15 12:55:46,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {6586#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6586#true} is VALID [2022-04-15 12:55:46,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {6586#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6586#true} is VALID [2022-04-15 12:55:46,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {6586#true} ~z~0 := ~y~0; {6622#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:46,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {6622#(= 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; {6626#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 12:55:46,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {6626#(= 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; {6630#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:55:46,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {6630#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6630#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 12:55:46,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {6630#(= (+ main_~z~0 1) (+ (- 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; {6622#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:46,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {6622#(= main_~z~0 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; {6640#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-15 12:55:46,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {6640#(= (+ main_~y~0 2) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:46,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {6591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:46,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {6591#(<= 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; {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L272 TraceCheckUtils]: 22: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-15 12:55:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:46,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:46,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#false} assume !false; {6587#false} is VALID [2022-04-15 12:55:46,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#false} assume 0 == ~cond; {6587#false} is VALID [2022-04-15 12:55:46,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {6587#false} ~cond := #in~cond; {6587#false} is VALID [2022-04-15 12:55:46,869 INFO L272 TraceCheckUtils]: 22: Hoare triple {6587#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6587#false} is VALID [2022-04-15 12:55:46,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {6587#false} assume !(~z~0 % 4294967296 > 0); {6587#false} is VALID [2022-04-15 12:55:46,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {6591#(<= 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; {6587#false} is VALID [2022-04-15 12:55:46,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {6591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:55:46,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:55:46,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {6710#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:55:46,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {6714#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {6710#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:46,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {6718#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6714#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:46,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {6718#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6718#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:46,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {6725#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {6718#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:46,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {6729#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {6725#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-15 12:55:46,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {6586#true} ~z~0 := ~y~0; {6729#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:55:46,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {6586#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6586#true} is VALID [2022-04-15 12:55:46,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {6586#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6586#true} is VALID [2022-04-15 12:55:46,881 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; {6586#true} is VALID [2022-04-15 12:55:46,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {6586#true} call #t~ret15 := main(); {6586#true} is VALID [2022-04-15 12:55:46,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6586#true} {6586#true} #83#return; {6586#true} is VALID [2022-04-15 12:55:46,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {6586#true} assume true; {6586#true} is VALID [2022-04-15 12:55:46,881 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-15 12:55:46,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {6586#true} call ULTIMATE.init(); {6586#true} is VALID [2022-04-15 12:55:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:46,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150131561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:46,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:46,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-15 12:55:46,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:46,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [450170333] [2022-04-15 12:55:46,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [450170333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:46,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:46,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250398295] [2022-04-15 12:55:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) 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 27 [2022-04-15 12:55:46,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:46,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) 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-15 12:55:47,004 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-15 12:55:47,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:55:47,005 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:47,794 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2022-04-15 12:55:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:55:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) 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 27 [2022-04-15 12:55:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 12:55:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 12:55:47,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-15 12:55:47,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:47,864 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:55:47,864 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:55:47,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:55:47,865 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:47,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 37 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:55:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 12:55:48,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:48,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,099 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,099 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:48,101 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-15 12:55:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-15 12:55:48,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:48,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:48,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 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 62 states. [2022-04-15 12:55:48,101 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 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 62 states. [2022-04-15 12:55:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:48,102 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-15 12:55:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-15 12:55:48,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:48,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:48,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:48,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-04-15 12:55:48,104 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 27 [2022-04-15 12:55:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:48,104 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-04-15 12:55:48,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) 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-15 12:55:48,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 83 transitions. [2022-04-15 12:55:48,436 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-15 12:55:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-15 12:55:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:55:48,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:48,437 INFO L499 BasicCegarLoop]: 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-15 12:55:48,452 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-15 12:55:48,643 WARN L460 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-15 12:55:48,643 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 6 times [2022-04-15 12:55:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:48,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521815838] [2022-04-15 12:55:48,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1551074820, now seen corresponding path program 1 times [2022-04-15 12:55:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551396543] [2022-04-15 12:55:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:48,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {7179#(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); {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {7171#true} assume true; {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7171#true} {7171#true} #83#return; {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {7171#true} call ULTIMATE.init(); {7179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:48,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {7179#(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); {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {7171#true} assume true; {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7171#true} {7171#true} #83#return; {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {7171#true} call #t~ret15 := main(); {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {7171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7171#true} is VALID [2022-04-15 12:55:48,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {7171#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7171#true} is VALID [2022-04-15 12:55:48,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {7171#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:48,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:48,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {7176#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:48,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {7177#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:48,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:48,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:48,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:48,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:48,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:48,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {7177#(<= 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; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#(<= 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; {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {7172#false} assume !(~x~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {7172#false} assume !(~z~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L272 TraceCheckUtils]: 22: Hoare triple {7172#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {7172#false} ~cond := #in~cond; {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {7172#false} assume 0 == ~cond; {7172#false} is VALID [2022-04-15 12:55:48,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {7172#false} assume !false; {7172#false} is VALID [2022-04-15 12:55:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551396543] [2022-04-15 12:55:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551396543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854266638] [2022-04-15 12:55:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:48,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:48,880 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-15 12:55:48,881 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-15 12:55:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:48,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:55:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:48,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:49,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {7171#true} call ULTIMATE.init(); {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7171#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); {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {7171#true} assume true; {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7171#true} {7171#true} #83#return; {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {7171#true} call #t~ret15 := main(); {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {7171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7171#true} is VALID [2022-04-15 12:55:49,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {7171#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7171#true} is VALID [2022-04-15 12:55:49,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {7171#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {7176#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {7177#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {7177#(<= 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; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#(<= 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; {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {7172#false} assume !(~x~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {7172#false} assume !(~z~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L272 TraceCheckUtils]: 22: Hoare triple {7172#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7172#false} is VALID [2022-04-15 12:55:49,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {7172#false} ~cond := #in~cond; {7172#false} is VALID [2022-04-15 12:55:49,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {7172#false} assume 0 == ~cond; {7172#false} is VALID [2022-04-15 12:55:49,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {7172#false} assume !false; {7172#false} is VALID [2022-04-15 12:55:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:49,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {7172#false} assume !false; {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {7172#false} assume 0 == ~cond; {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {7172#false} ~cond := #in~cond; {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L272 TraceCheckUtils]: 22: Hoare triple {7172#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {7172#false} assume !(~z~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {7172#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; {7172#false} is VALID [2022-04-15 12:55:49,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {7172#false} assume !(~x~0 % 4294967296 > 0); {7172#false} is VALID [2022-04-15 12:55:49,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#(<= 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; {7172#false} is VALID [2022-04-15 12:55:49,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {7177#(<= 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; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {7178#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {7177#(<= 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; {7178#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:49,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {7176#(<= 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; {7177#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:55:49,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {7171#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7176#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:55:49,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {7171#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {7171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {7171#true} call #t~ret15 := main(); {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7171#true} {7171#true} #83#return; {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {7171#true} assume true; {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {7171#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); {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {7171#true} call ULTIMATE.init(); {7171#true} is VALID [2022-04-15 12:55:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854266638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:49,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:49,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-15 12:55:49,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521815838] [2022-04-15 12:55:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521815838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:49,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:55:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799597996] [2022-04-15 12:55:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) 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 27 [2022-04-15 12:55:49,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:49,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) 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-15 12:55:49,470 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-15 12:55:49,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:55:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:55:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:55:49,471 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:50,132 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-04-15 12:55:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:55:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) 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 27 [2022-04-15 12:55:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 12:55:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) 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-15 12:55:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 12:55:50,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-15 12:55:50,213 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-15 12:55:50,214 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:55:50,214 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:55:50,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:55:50,215 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:50,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 29 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:55:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:55:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 12:55:50,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:50,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,419 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,419 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:50,420 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-15 12:55:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-15 12:55:50,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:50,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:50,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:55:50,421 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:55:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:50,422 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-15 12:55:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-15 12:55:50,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:50,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:50,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:50,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-04-15 12:55:50,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 27 [2022-04-15 12:55:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:50,423 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-04-15 12:55:50,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) 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-15 12:55:50,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 74 transitions. [2022-04-15 12:55:50,718 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-15 12:55:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-04-15 12:55:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:55:50,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:50,718 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:50,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:55:50,919 WARN L460 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-15 12:55:50,919 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 149891424, now seen corresponding path program 5 times [2022-04-15 12:55:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:50,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [784508419] [2022-04-15 12:55:51,059 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1992885087, now seen corresponding path program 1 times [2022-04-15 12:55:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:51,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468402199] [2022-04-15 12:55:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {7734#(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); {7723#true} is VALID [2022-04-15 12:55:51,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-04-15 12:55:51,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7723#true} {7723#true} #83#return; {7723#true} is VALID [2022-04-15 12:55:51,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {7723#true} call ULTIMATE.init(); {7734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:51,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {7734#(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); {7723#true} is VALID [2022-04-15 12:55:51,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-04-15 12:55:51,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#true} {7723#true} #83#return; {7723#true} is VALID [2022-04-15 12:55:51,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#true} call #t~ret15 := main(); {7723#true} is VALID [2022-04-15 12:55:51,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7728#(= main_~y~0 0)} is VALID [2022-04-15 12:55:51,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {7728#(= main_~y~0 0)} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7729#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:55:51,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {7729#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7729#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:55:51,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {7729#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {7730#(or (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= main_~y~0 0)) (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-15 12:55:51,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {7730#(or (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= main_~y~0 0)) (<= (* (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; {7731#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {7731#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {7732#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {7732#(<= main_~x~0 (+ 4294967296 (* (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; {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (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; {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (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; {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (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; {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7733#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {7733#(<= main_~x~0 (+ 4294967297 (* (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; {7732#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {7732#(<= main_~x~0 (+ 4294967296 (* (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; {7731#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:55:51,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {7731#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {7724#false} is VALID [2022-04-15 12:55:51,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {7724#false} assume !(~z~0 % 4294967296 > 0); {7724#false} is VALID [2022-04-15 12:55:51,272 INFO L272 TraceCheckUtils]: 21: Hoare triple {7724#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7724#false} is VALID [2022-04-15 12:55:51,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {7724#false} ~cond := #in~cond; {7724#false} is VALID [2022-04-15 12:55:51,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {7724#false} assume 0 == ~cond; {7724#false} is VALID [2022-04-15 12:55:51,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {7724#false} assume !false; {7724#false} is VALID [2022-04-15 12:55:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:55:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:51,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468402199] [2022-04-15 12:55:51,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468402199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:51,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623430495] [2022-04-15 12:55:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:51,274 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-15 12:55:51,275 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-15 12:55:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:55:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:51,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {7723#true} call ULTIMATE.init(); {7723#true} is VALID [2022-04-15 12:55:51,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#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); {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#true} {7723#true} #83#return; {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#true} call #t~ret15 := main(); {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7723#true} is VALID [2022-04-15 12:55:51,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {7723#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7723#true} is VALID [2022-04-15 12:55:51,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {7723#true} ~z~0 := ~y~0; {7762#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:55:51,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {7762#(= 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; {7766#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:55:51,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {7766#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {7770#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:51,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {7770#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 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; {7774#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:51,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {7774#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7774#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:55:51,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {7774#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (< 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; {7781#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 12:55:51,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {7781#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= 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; {7785#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:55:51,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {7789#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:51,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {7789#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7789#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:55:51,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {7789#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 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; {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {7796#(< 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; {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {7796#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {7796#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7724#false} is VALID [2022-04-15 12:55:51,652 INFO L272 TraceCheckUtils]: 21: Hoare triple {7724#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7724#false} is VALID [2022-04-15 12:55:51,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {7724#false} ~cond := #in~cond; {7724#false} is VALID [2022-04-15 12:55:51,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {7724#false} assume 0 == ~cond; {7724#false} is VALID [2022-04-15 12:55:51,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {7724#false} assume !false; {7724#false} is VALID [2022-04-15 12:55:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:51,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:51,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {7724#false} assume !false; {7724#false} is VALID [2022-04-15 12:55:51,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {7724#false} assume 0 == ~cond; {7724#false} is VALID [2022-04-15 12:55:51,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {7724#false} ~cond := #in~cond; {7724#false} is VALID [2022-04-15 12:55:51,848 INFO L272 TraceCheckUtils]: 21: Hoare triple {7724#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7724#false} is VALID [2022-04-15 12:55:51,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {7796#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7724#false} is VALID [2022-04-15 12:55:51,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {7796#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {7796#(< 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; {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {7796#(< 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; {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {7796#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {7845#(< 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; {7796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:55:51,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {7849#(< 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; {7845#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:51,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {7853#(< 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; {7849#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:51,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {7853#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7853#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:51,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {7849#(< 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; {7853#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:55:51,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {7845#(< 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; {7849#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:55:51,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {7723#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; {7845#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:55:51,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {7723#true} ~z~0 := ~y~0; {7723#true} is VALID [2022-04-15 12:55:51,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {7723#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7723#true} is VALID [2022-04-15 12:55:51,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7723#true} is VALID [2022-04-15 12:55:51,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7723#true} is VALID [2022-04-15 12:55:51,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#true} call #t~ret15 := main(); {7723#true} is VALID [2022-04-15 12:55:51,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#true} {7723#true} #83#return; {7723#true} is VALID [2022-04-15 12:55:51,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-04-15 12:55:51,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#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); {7723#true} is VALID [2022-04-15 12:55:51,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {7723#true} call ULTIMATE.init(); {7723#true} is VALID [2022-04-15 12:55:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:55:51,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623430495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:51,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:51,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 20 [2022-04-15 12:55:52,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:52,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [784508419] [2022-04-15 12:55:52,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [784508419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:52,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:52,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:55:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144148740] [2022-04-15 12:55:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:52,178 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 27 [2022-04-15 12:55:52,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:52,178 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-15 12:55:52,211 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-15 12:55:52,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:55:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:55:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:55:52,212 INFO L87 Difference]: Start difference. First operand 55 states and 74 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-15 12:55:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:54,041 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-15 12:55:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:55:54,041 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 27 [2022-04-15 12:55:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:54,041 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-15 12:55:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-15 12:55:54,042 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-15 12:55:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-15 12:55:54,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2022-04-15 12:55:54,190 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-15 12:55:54,191 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:55:54,191 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:55:54,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:55:54,192 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:54,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 50 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:55:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:55:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-04-15 12:55:54,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:54,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:54,468 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:54,468 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:54,469 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-15 12:55:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-15 12:55:54,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:54,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:54,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 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 59 states. [2022-04-15 12:55:54,469 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 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 59 states. [2022-04-15 12:55:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:54,471 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-15 12:55:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-15 12:55:54,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:54,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:54,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:54,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-04-15 12:55:54,474 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 27 [2022-04-15 12:55:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:54,475 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-04-15 12:55:54,475 INFO L479 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-15 12:55:54,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 77 transitions. [2022-04-15 12:55:55,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-04-15 12:55:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:55:55,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:55,128 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:55,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:55,328 WARN L460 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-15 12:55:55,329 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1678337854, now seen corresponding path program 6 times [2022-04-15 12:55:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:55,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533701445] [2022-04-15 12:55:55,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash -161756931, now seen corresponding path program 1 times [2022-04-15 12:55:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:55,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658659862] [2022-04-15 12:55:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:55,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {8308#(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); {8295#true} is VALID [2022-04-15 12:55:55,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {8295#true} assume true; {8295#true} is VALID [2022-04-15 12:55:55,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8295#true} {8295#true} #83#return; {8295#true} is VALID [2022-04-15 12:55:55,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {8295#true} call ULTIMATE.init(); {8308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:55,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {8308#(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); {8295#true} is VALID [2022-04-15 12:55:55,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {8295#true} assume true; {8295#true} is VALID [2022-04-15 12:55:55,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8295#true} {8295#true} #83#return; {8295#true} is VALID [2022-04-15 12:55:55,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {8295#true} call #t~ret15 := main(); {8295#true} is VALID [2022-04-15 12:55:55,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {8295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8295#true} is VALID [2022-04-15 12:55:55,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {8295#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8295#true} is VALID [2022-04-15 12:55:55,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {8295#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8295#true} is VALID [2022-04-15 12:55:55,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {8295#true} ~z~0 := ~y~0; {8300#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:55,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {8300#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8301#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:55,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {8301#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8302#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:55,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {8302#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8303#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:55:55,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {8303#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:55,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:55,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:55:55,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:55,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:55,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:55,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {8296#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; {8296#false} is VALID [2022-04-15 12:55:55,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {8296#false} assume !(~x~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {8296#false} assume !(~z~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L272 TraceCheckUtils]: 21: Hoare triple {8296#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {8296#false} ~cond := #in~cond; {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {8296#false} assume 0 == ~cond; {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {8296#false} assume !false; {8296#false} is VALID [2022-04-15 12:55:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658659862] [2022-04-15 12:55:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658659862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999057861] [2022-04-15 12:55:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:55,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:55,649 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-15 12:55:55,652 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-15 12:55:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:55,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:55:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:55,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:56,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {8295#true} call ULTIMATE.init(); {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {8295#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); {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {8295#true} assume true; {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8295#true} {8295#true} #83#return; {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {8295#true} call #t~ret15 := main(); {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {8295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {8295#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8295#true} is VALID [2022-04-15 12:55:56,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {8295#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8295#true} is VALID [2022-04-15 12:55:56,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {8295#true} ~z~0 := ~y~0; {8300#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:55:56,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {8300#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8301#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:55:56,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {8301#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8302#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:55:56,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {8302#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8303#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:55:56,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {8303#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:56,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:56,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:55:56,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:56,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:56,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {8296#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; {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {8296#false} assume !(~x~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {8296#false} assume !(~z~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L272 TraceCheckUtils]: 21: Hoare triple {8296#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {8296#false} ~cond := #in~cond; {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {8296#false} assume 0 == ~cond; {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {8296#false} assume !false; {8296#false} is VALID [2022-04-15 12:55:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:56,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {8296#false} assume !false; {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {8296#false} assume 0 == ~cond; {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {8296#false} ~cond := #in~cond; {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L272 TraceCheckUtils]: 21: Hoare triple {8296#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {8296#false} assume !(~z~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {8296#false} assume !(~x~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {8296#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; {8296#false} is VALID [2022-04-15 12:55:56,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8296#false} is VALID [2022-04-15 12:55:56,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8307#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:55:56,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8306#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:55:56,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8305#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:55:56,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:56,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {8420#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8304#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:55:56,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {8424#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8420#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:55:56,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {8428#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8424#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:55:56,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {8432#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8428#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:55:56,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {8295#true} ~z~0 := ~y~0; {8432#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:55:56,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {8295#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8295#true} is VALID [2022-04-15 12:55:56,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {8295#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8295#true} is VALID [2022-04-15 12:55:56,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {8295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {8295#true} call #t~ret15 := main(); {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8295#true} {8295#true} #83#return; {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {8295#true} assume true; {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {8295#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); {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {8295#true} call ULTIMATE.init(); {8295#true} is VALID [2022-04-15 12:55:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:55:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999057861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:56,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:56,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 12:55:56,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533701445] [2022-04-15 12:55:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533701445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:56,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:55:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81681138] [2022-04-15 12:55:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:56,684 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-15 12:55:56,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:56,685 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-15 12:55:56,727 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-15 12:55:56,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:55:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:55:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:55:56,728 INFO L87 Difference]: Start difference. First operand 57 states and 77 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-15 12:55:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:59,777 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2022-04-15 12:55:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:55:59,778 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-15 12:55:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:59,778 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-15 12:55:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 12:55:59,779 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-15 12:55:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 12:55:59,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions. [2022-04-15 12:56:00,004 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-15 12:56:00,005 INFO L225 Difference]: With dead ends: 87 [2022-04-15 12:56:00,005 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:56:00,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:56:00,006 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:00,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 73 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:56:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:56:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-04-15 12:56:00,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:00,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:00,217 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:00,218 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:00,219 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-15 12:56:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2022-04-15 12:56:00,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:00,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:00,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 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 61 states. [2022-04-15 12:56:00,220 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 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 61 states. [2022-04-15 12:56:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:00,221 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-15 12:56:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2022-04-15 12:56:00,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:00,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:00,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:00,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 12:56:00,222 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 27 [2022-04-15 12:56:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:00,222 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-04-15 12:56:00,222 INFO L479 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-15 12:56:00,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-15 12:56:00,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-15 12:56:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:56:00,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:00,676 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:00,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 12:56:00,876 WARN L460 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-15 12:56:00,877 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1788990354, now seen corresponding path program 7 times [2022-04-15 12:56:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:00,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973832907] [2022-04-15 12:56:01,011 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1925965325, now seen corresponding path program 1 times [2022-04-15 12:56:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342307698] [2022-04-15 12:56:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:01,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {8916#(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); {8905#true} is VALID [2022-04-15 12:56:01,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {8905#true} assume true; {8905#true} is VALID [2022-04-15 12:56:01,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8905#true} {8905#true} #83#return; {8905#true} is VALID [2022-04-15 12:56:01,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {8905#true} call ULTIMATE.init(); {8916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#(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); {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {8905#true} assume true; {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8905#true} {8905#true} #83#return; {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {8905#true} call #t~ret15 := main(); {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {8905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {8905#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {8905#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8905#true} is VALID [2022-04-15 12:56:01,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {8905#true} ~z~0 := ~y~0; {8905#true} is VALID [2022-04-15 12:56:01,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {8905#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; {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {8911#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:01,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {8911#(<= main_~z~0 (+ (* (div main_~z~0 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; {8912#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {8912#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8912#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {8912#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8913#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:56:01,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {8913#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8914#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-15 12:56:01,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {8914#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) 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; {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) 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; {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) 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; {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:56:01,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {8915#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8906#false} is VALID [2022-04-15 12:56:01,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {8906#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8906#false} is VALID [2022-04-15 12:56:01,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {8906#false} ~cond := #in~cond; {8906#false} is VALID [2022-04-15 12:56:01,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {8906#false} assume 0 == ~cond; {8906#false} is VALID [2022-04-15 12:56:01,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {8906#false} assume !false; {8906#false} is VALID [2022-04-15 12:56:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:01,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342307698] [2022-04-15 12:56:01,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342307698] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:01,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660954758] [2022-04-15 12:56:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:01,154 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-15 12:56:01,156 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-15 12:56:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:01,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:56:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:01,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:01,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {8905#true} call ULTIMATE.init(); {8905#true} is VALID [2022-04-15 12:56:01,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {8905#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); {8905#true} is VALID [2022-04-15 12:56:01,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {8905#true} assume true; {8905#true} is VALID [2022-04-15 12:56:01,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8905#true} {8905#true} #83#return; {8905#true} is VALID [2022-04-15 12:56:01,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {8905#true} call #t~ret15 := main(); {8905#true} is VALID [2022-04-15 12:56:01,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {8905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8905#true} is VALID [2022-04-15 12:56:01,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {8905#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8905#true} is VALID [2022-04-15 12:56:01,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {8905#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8905#true} is VALID [2022-04-15 12:56:01,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {8905#true} ~z~0 := ~y~0; {8905#true} is VALID [2022-04-15 12:56:01,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {8905#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; {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:01,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {8950#(<= main_~z~0 (+ (* (div (+ main_~z~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; {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:01,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8906#false} is VALID [2022-04-15 12:56:01,502 INFO L272 TraceCheckUtils]: 22: Hoare triple {8906#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8906#false} is VALID [2022-04-15 12:56:01,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {8906#false} ~cond := #in~cond; {8906#false} is VALID [2022-04-15 12:56:01,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {8906#false} assume 0 == ~cond; {8906#false} is VALID [2022-04-15 12:56:01,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {8906#false} assume !false; {8906#false} is VALID [2022-04-15 12:56:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:01,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:01,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {8906#false} assume !false; {8906#false} is VALID [2022-04-15 12:56:01,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {8906#false} assume 0 == ~cond; {8906#false} is VALID [2022-04-15 12:56:01,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {8906#false} ~cond := #in~cond; {8906#false} is VALID [2022-04-15 12:56:01,610 INFO L272 TraceCheckUtils]: 22: Hoare triple {8906#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8906#false} is VALID [2022-04-15 12:56:01,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8906#false} is VALID [2022-04-15 12:56:01,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8967#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:01,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:01,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {8950#(<= main_~z~0 (+ (* (div (+ main_~z~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; {8954#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {8950#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {8905#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; {8910#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {8905#true} ~z~0 := ~y~0; {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {8905#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {8905#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {8905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {8905#true} call #t~ret15 := main(); {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8905#true} {8905#true} #83#return; {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {8905#true} assume true; {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {8905#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); {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {8905#true} call ULTIMATE.init(); {8905#true} is VALID [2022-04-15 12:56:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:01,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660954758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:01,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:01,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-15 12:56:01,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973832907] [2022-04-15 12:56:01,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973832907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:01,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:01,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:56:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857996330] [2022-04-15 12:56:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:01,730 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 28 [2022-04-15 12:56:01,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:01,731 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-15 12:56:01,765 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-15 12:56:01,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:56:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:56:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:56:01,765 INFO L87 Difference]: Start difference. First operand 49 states and 63 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-15 12:56:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:03,359 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-04-15 12:56:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:56:03,359 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 28 [2022-04-15 12:56:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:03,359 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-15 12:56:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 12:56:03,360 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-15 12:56:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 12:56:03,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-15 12:56:03,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:03,526 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:56:03,526 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:56:03,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:56:03,527 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:03,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:56:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:56:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-04-15 12:56:03,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:03,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:03,827 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:03,827 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:03,828 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-15 12:56:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-15 12:56:03,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:03,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:03,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 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 63 states. [2022-04-15 12:56:03,829 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 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 63 states. [2022-04-15 12:56:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:03,830 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-15 12:56:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-15 12:56:03,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:03,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:03,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:03,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-04-15 12:56:03,831 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 28 [2022-04-15 12:56:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:03,831 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-04-15 12:56:03,831 INFO L479 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-15 12:56:03,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 72 transitions. [2022-04-15 12:56:04,383 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-15 12:56:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-15 12:56:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:56:04,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:04,383 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:04,401 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-15 12:56:04,584 WARN L460 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-15 12:56:04,584 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1424549923, now seen corresponding path program 8 times [2022-04-15 12:56:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109296279] [2022-04-15 12:56:04,700 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -502030652, now seen corresponding path program 1 times [2022-04-15 12:56:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:04,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347482498] [2022-04-15 12:56:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:04,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(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); {9487#true} is VALID [2022-04-15 12:56:04,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {9487#true} assume true; {9487#true} is VALID [2022-04-15 12:56:04,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9487#true} {9487#true} #83#return; {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:04,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {9498#(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); {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #83#return; {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret15 := main(); {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {9487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9487#true} is VALID [2022-04-15 12:56:04,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9487#true} is VALID [2022-04-15 12:56:04,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9492#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:04,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {9492#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9492#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:04,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {9492#(<= 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; {9493#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:04,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {9493#(<= 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; {9494#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {9494#(<= 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; {9495#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {9495#(<= 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; {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {9496#(<= 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; {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {9496#(<= 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; {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {9496#(<= 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; {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {9496#(<= 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; {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9496#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:04,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {9496#(<= 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; {9497#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:04,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {9497#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {9488#false} assume !(~z~0 % 4294967296 > 0); {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L272 TraceCheckUtils]: 22: Hoare triple {9488#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2022-04-15 12:56:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:56:04,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:04,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347482498] [2022-04-15 12:56:04,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347482498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:04,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450091232] [2022-04-15 12:56:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:04,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:04,880 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-15 12:56:04,881 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-15 12:56:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:04,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:56:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:04,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:05,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {9487#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); {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #83#return; {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret15 := main(); {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {9487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9487#true} is VALID [2022-04-15 12:56:05,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9487#true} is VALID [2022-04-15 12:56:05,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {9487#true} ~z~0 := ~y~0; {9526#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:05,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#(= 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; {9530#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:56:05,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {9530#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {9534#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 12:56:05,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {9534#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9538#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:05,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {9538#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 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; {9542#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:05,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {9542#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9542#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:56:05,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {9542#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 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; {9549#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 3) (+ main_~y~0 1)))} is VALID [2022-04-15 12:56:05,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {9549#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 3) (+ 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; {9553#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~y~0 2) (+ main_~z~0 2)))} is VALID [2022-04-15 12:56:05,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {9553#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~y~0 2) (+ main_~z~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; {9557#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:56:05,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {9557#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= (+ main_~y~0 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; {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {9561#(< 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; {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9488#false} is VALID [2022-04-15 12:56:05,357 INFO L272 TraceCheckUtils]: 22: Hoare triple {9488#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9488#false} is VALID [2022-04-15 12:56:05,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2022-04-15 12:56:05,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2022-04-15 12:56:05,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2022-04-15 12:56:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:05,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:05,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2022-04-15 12:56:05,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {9488#false} assume 0 == ~cond; {9488#false} is VALID [2022-04-15 12:56:05,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {9488#false} ~cond := #in~cond; {9488#false} is VALID [2022-04-15 12:56:05,595 INFO L272 TraceCheckUtils]: 22: Hoare triple {9488#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9488#false} is VALID [2022-04-15 12:56:05,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9488#false} is VALID [2022-04-15 12:56:05,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {9561#(< 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; {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {9561#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {9610#(< 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; {9561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:05,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {9614#(< 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; {9610#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:05,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {9618#(< 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; {9614#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:05,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {9622#(< 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; {9618#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:05,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {9622#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9622#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:05,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {9618#(< 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; {9622#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:05,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {9614#(< 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; {9618#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:05,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {9610#(< 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; {9614#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {9487#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; {9610#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {9487#true} ~z~0 := ~y~0; {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {9487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {9487#true} call #t~ret15 := main(); {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9487#true} {9487#true} #83#return; {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {9487#true} assume true; {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9487#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); {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2022-04-15 12:56:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450091232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:05,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 22 [2022-04-15 12:56:05,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:05,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109296279] [2022-04-15 12:56:05,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109296279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:05,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:05,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:56:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596132424] [2022-04-15 12:56:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:05,843 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 28 [2022-04-15 12:56:05,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:05,843 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-15 12:56:05,882 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-15 12:56:05,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:56:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:56:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:56:05,883 INFO L87 Difference]: Start difference. First operand 56 states and 72 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-15 12:56:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:07,811 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-04-15 12:56:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:56:07,812 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 28 [2022-04-15 12:56:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:07,812 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-15 12:56:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-04-15 12:56:07,813 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-15 12:56:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-04-15 12:56:07,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 81 transitions. [2022-04-15 12:56:07,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:07,979 INFO L225 Difference]: With dead ends: 102 [2022-04-15 12:56:07,979 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 12:56:07,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:56:07,980 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:07,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 42 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:56:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 12:56:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2022-04-15 12:56:08,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:08,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,273 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,274 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:08,275 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-04-15 12:56:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2022-04-15 12:56:08,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:08,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:08,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 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-15 12:56:08,276 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 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-15 12:56:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:08,277 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-04-15 12:56:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2022-04-15 12:56:08,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:08,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:08,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:08,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2022-04-15 12:56:08,279 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 28 [2022-04-15 12:56:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:08,279 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2022-04-15 12:56:08,279 INFO L479 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-15 12:56:08,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 85 transitions. [2022-04-15 12:56:09,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-15 12:56:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:56:09,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:09,064 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:09,079 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-15 12:56:09,264 WARN L460 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-15 12:56:09,264 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 22222479, now seen corresponding path program 9 times [2022-04-15 12:56:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:09,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767994647] [2022-04-15 12:56:09,400 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 32820174, now seen corresponding path program 1 times [2022-04-15 12:56:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:09,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005153000] [2022-04-15 12:56:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:09,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {10223#(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); {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {10210#true} assume true; {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10210#true} {10210#true} #83#return; {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {10210#true} call ULTIMATE.init(); {10223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:09,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {10223#(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); {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {10210#true} assume true; {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10210#true} {10210#true} #83#return; {10210#true} is VALID [2022-04-15 12:56:09,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {10210#true} call #t~ret15 := main(); {10210#true} is VALID [2022-04-15 12:56:09,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {10210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10210#true} is VALID [2022-04-15 12:56:09,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {10210#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10210#true} is VALID [2022-04-15 12:56:09,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {10210#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10210#true} is VALID [2022-04-15 12:56:09,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {10210#true} ~z~0 := ~y~0; {10215#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:09,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10216#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:09,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {10216#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10217#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:09,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {10217#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10218#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:09,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {10218#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {10219#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:09,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {10219#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:09,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:09,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {10211#false} assume !(~y~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {10211#false} assume !(~x~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#false} assume !(~z~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L272 TraceCheckUtils]: 23: Hoare triple {10211#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {10211#false} ~cond := #in~cond; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#false} assume 0 == ~cond; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#false} assume !false; {10211#false} is VALID [2022-04-15 12:56:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:09,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005153000] [2022-04-15 12:56:09,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005153000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:09,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129495120] [2022-04-15 12:56:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:09,588 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-15 12:56:09,588 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-15 12:56:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:09,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:56:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:09,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:09,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {10210#true} call ULTIMATE.init(); {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {10210#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); {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {10210#true} assume true; {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10210#true} {10210#true} #83#return; {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {10210#true} call #t~ret15 := main(); {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {10210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {10210#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10210#true} is VALID [2022-04-15 12:56:09,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {10210#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10210#true} is VALID [2022-04-15 12:56:09,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {10210#true} ~z~0 := ~y~0; {10215#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:09,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10216#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:09,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {10216#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10217#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:09,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {10217#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10218#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:09,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {10218#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {10263#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 12:56:09,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {10263#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~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; {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:09,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:09,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:09,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10211#false} is VALID [2022-04-15 12:56:09,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {10211#false} assume !(~y~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {10211#false} assume !(~x~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#false} assume !(~z~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L272 TraceCheckUtils]: 23: Hoare triple {10211#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {10211#false} ~cond := #in~cond; {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#false} assume 0 == ~cond; {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#false} assume !false; {10211#false} is VALID [2022-04-15 12:56:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:09,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:12,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#false} assume !false; {10211#false} is VALID [2022-04-15 12:56:12,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#false} assume 0 == ~cond; {10211#false} is VALID [2022-04-15 12:56:12,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {10211#false} ~cond := #in~cond; {10211#false} is VALID [2022-04-15 12:56:12,549 INFO L272 TraceCheckUtils]: 23: Hoare triple {10211#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10211#false} is VALID [2022-04-15 12:56:12,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#false} assume !(~z~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:12,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {10211#false} assume !(~x~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:12,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:12,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:12,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#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; {10211#false} is VALID [2022-04-15 12:56:12,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {10211#false} assume !(~y~0 % 4294967296 > 0); {10211#false} is VALID [2022-04-15 12:56:12,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10211#false} is VALID [2022-04-15 12:56:12,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10222#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:12,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10221#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:12,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {10263#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~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; {10220#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:12,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {10348#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10263#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 12:56:12,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {10352#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {10348#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 12:56:12,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {10356#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~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; {10352#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:12,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {10360#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 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; {10356#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {10210#true} ~z~0 := ~y~0; {10360#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {10210#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {10210#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {10210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {10210#true} call #t~ret15 := main(); {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10210#true} {10210#true} #83#return; {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {10210#true} assume true; {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {10210#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); {10210#true} is VALID [2022-04-15 12:56:12,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {10210#true} call ULTIMATE.init(); {10210#true} is VALID [2022-04-15 12:56:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:12,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129495120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:12,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:12,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-15 12:56:12,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767994647] [2022-04-15 12:56:12,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767994647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:12,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:12,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:56:12,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212498163] [2022-04-15 12:56:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:12,755 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 29 [2022-04-15 12:56:12,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:12,756 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-15 12:56:12,795 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-15 12:56:12,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:56:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:56:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:56:12,796 INFO L87 Difference]: Start difference. First operand 66 states and 85 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-15 12:56:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,579 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-15 12:56:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:56:15,579 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 29 [2022-04-15 12:56:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:15,579 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-15 12:56:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 12:56:15,580 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-15 12:56:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 12:56:15,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-15 12:56:15,696 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-15 12:56:15,697 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:56:15,697 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:56:15,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:56:15,697 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:15,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 68 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:56:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:56:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-04-15 12:56:15,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:15,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,988 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,988 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,989 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-04-15 12:56:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-04-15 12:56:15,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:15,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:15,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 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 68 states. [2022-04-15 12:56:15,989 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 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 68 states. [2022-04-15 12:56:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:15,990 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-04-15 12:56:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-04-15 12:56:15,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:15,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:15,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:15,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2022-04-15 12:56:15,991 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2022-04-15 12:56:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:15,991 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2022-04-15 12:56:15,991 INFO L479 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-15 12:56:15,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 82 transitions. [2022-04-15 12:56:16,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-04-15 12:56:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:56:16,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:16,752 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:16,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:16,952 WARN L460 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-15 12:56:16,952 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash 655213199, now seen corresponding path program 10 times [2022-04-15 12:56:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:16,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643088499] [2022-04-15 12:56:17,103 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash 270864270, now seen corresponding path program 1 times [2022-04-15 12:56:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:17,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698684159] [2022-04-15 12:56:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:17,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {10862#(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); {10847#true} is VALID [2022-04-15 12:56:17,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {10847#true} assume true; {10847#true} is VALID [2022-04-15 12:56:17,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10847#true} {10847#true} #83#return; {10847#true} is VALID [2022-04-15 12:56:17,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {10847#true} call ULTIMATE.init(); {10862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:17,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {10862#(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); {10847#true} is VALID [2022-04-15 12:56:17,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {10847#true} assume true; {10847#true} is VALID [2022-04-15 12:56:17,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10847#true} {10847#true} #83#return; {10847#true} is VALID [2022-04-15 12:56:17,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {10847#true} call #t~ret15 := main(); {10847#true} is VALID [2022-04-15 12:56:17,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {10847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10847#true} is VALID [2022-04-15 12:56:17,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {10847#true} [131] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10847#true} is VALID [2022-04-15 12:56:17,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {10847#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10847#true} is VALID [2022-04-15 12:56:17,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {10847#true} ~z~0 := ~y~0; {10852#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:17,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {10852#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10853#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:17,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {10853#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10854#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:17,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {10854#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10855#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:17,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {10855#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10856#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:17,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {10856#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:17,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:17,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:17,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:17,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:17,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#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; {10848#false} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {10848#false} assume !(~x~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {10848#false} assume !(~z~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,354 INFO L272 TraceCheckUtils]: 23: Hoare triple {10848#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10848#false} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {10848#false} ~cond := #in~cond; {10848#false} is VALID [2022-04-15 12:56:17,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {10848#false} assume 0 == ~cond; {10848#false} is VALID [2022-04-15 12:56:17,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {10848#false} assume !false; {10848#false} is VALID [2022-04-15 12:56:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:17,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698684159] [2022-04-15 12:56:17,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698684159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:17,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806115068] [2022-04-15 12:56:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:17,357 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-15 12:56:17,357 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-15 12:56:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:17,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:56:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:17,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:17,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {10847#true} call ULTIMATE.init(); {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {10847#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); {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {10847#true} assume true; {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10847#true} {10847#true} #83#return; {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {10847#true} call #t~ret15 := main(); {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {10847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {10847#true} [131] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {10847#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10847#true} is VALID [2022-04-15 12:56:17,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {10847#true} ~z~0 := ~y~0; {10852#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:17,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {10852#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10853#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:17,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {10853#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10854#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:17,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {10854#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10855#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:17,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {10855#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10856#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:17,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {10856#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:17,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:17,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:17,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:17,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:17,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#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; {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {10848#false} assume !(~x~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {10848#false} assume !(~z~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L272 TraceCheckUtils]: 23: Hoare triple {10848#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {10848#false} ~cond := #in~cond; {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {10848#false} assume 0 == ~cond; {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {10848#false} assume !false; {10848#false} is VALID [2022-04-15 12:56:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:17,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:18,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {10848#false} assume !false; {10848#false} is VALID [2022-04-15 12:56:18,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {10848#false} assume 0 == ~cond; {10848#false} is VALID [2022-04-15 12:56:18,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {10848#false} ~cond := #in~cond; {10848#false} is VALID [2022-04-15 12:56:18,312 INFO L272 TraceCheckUtils]: 23: Hoare triple {10848#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10848#false} is VALID [2022-04-15 12:56:18,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {10848#false} assume !(~z~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:18,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {10848#false} assume !(~x~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:18,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#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; {10848#false} is VALID [2022-04-15 12:56:18,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10848#false} is VALID [2022-04-15 12:56:18,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10861#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:18,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10860#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:18,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10859#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:18,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10858#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:18,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:18,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {10983#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10857#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:18,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {10987#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10983#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:18,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {10991#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10987#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 12:56:18,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {10995#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {10991#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:56:18,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {10999#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {10995#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:56:18,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {10847#true} ~z~0 := ~y~0; {10999#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:18,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {10847#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10847#true} is VALID [2022-04-15 12:56:18,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {10847#true} [131] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10847#true} is VALID [2022-04-15 12:56:18,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {10847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10847#true} is VALID [2022-04-15 12:56:18,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {10847#true} call #t~ret15 := main(); {10847#true} is VALID [2022-04-15 12:56:18,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10847#true} {10847#true} #83#return; {10847#true} is VALID [2022-04-15 12:56:18,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {10847#true} assume true; {10847#true} is VALID [2022-04-15 12:56:18,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {10847#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); {10847#true} is VALID [2022-04-15 12:56:18,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {10847#true} call ULTIMATE.init(); {10847#true} is VALID [2022-04-15 12:56:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:18,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806115068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:18,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:18,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:56:18,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:18,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643088499] [2022-04-15 12:56:18,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643088499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:18,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:18,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:56:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359183249] [2022-04-15 12:56:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:18,547 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-15 12:56:18,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:18,548 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-15 12:56:18,593 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-15 12:56:18,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:56:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:56:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:56:18,594 INFO L87 Difference]: Start difference. First operand 65 states and 82 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-15 12:56:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:27,353 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2022-04-15 12:56:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:56:27,353 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-15 12:56:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:27,353 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-15 12:56:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-04-15 12:56:27,355 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-15 12:56:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-04-15 12:56:27,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 108 transitions. [2022-04-15 12:56:28,180 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-15 12:56:28,182 INFO L225 Difference]: With dead ends: 122 [2022-04-15 12:56:28,182 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 12:56:28,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=553, Invalid=2869, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:56:28,183 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 91 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:28,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 88 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:56:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 12:56:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2022-04-15 12:56:28,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:28,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,558 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,558 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:28,561 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2022-04-15 12:56:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-04-15 12:56:28,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:28,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:28,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 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 98 states. [2022-04-15 12:56:28,561 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 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 98 states. [2022-04-15 12:56:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:28,563 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2022-04-15 12:56:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-04-15 12:56:28,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:28,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:28,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:28,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-04-15 12:56:28,565 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 29 [2022-04-15 12:56:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:28,565 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-04-15 12:56:28,565 INFO L479 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-15 12:56:28,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 93 transitions. [2022-04-15 12:56:29,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-04-15 12:56:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:56:29,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:29,857 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:29,872 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-15 12:56:30,057 WARN L460 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-15 12:56:30,058 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:30,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:30,058 INFO L85 PathProgramCache]: Analyzing trace with hash -227543310, now seen corresponding path program 11 times [2022-04-15 12:56:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:30,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656304010] [2022-04-15 12:56:30,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1384098323, now seen corresponding path program 1 times [2022-04-15 12:56:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:30,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65202310] [2022-04-15 12:56:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {11711#(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); {11699#true} is VALID [2022-04-15 12:56:30,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11699#true} assume true; {11699#true} is VALID [2022-04-15 12:56:30,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11699#true} {11699#true} #83#return; {11699#true} is VALID [2022-04-15 12:56:30,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {11699#true} call ULTIMATE.init(); {11711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:30,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11711#(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); {11699#true} is VALID [2022-04-15 12:56:30,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {11699#true} assume true; {11699#true} is VALID [2022-04-15 12:56:30,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11699#true} {11699#true} #83#return; {11699#true} is VALID [2022-04-15 12:56:30,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {11699#true} call #t~ret15 := main(); {11699#true} is VALID [2022-04-15 12:56:30,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {11699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11699#true} is VALID [2022-04-15 12:56:30,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {11699#true} [133] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11699#true} is VALID [2022-04-15 12:56:30,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {11699#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:30,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {11704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:56:30,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {11704#(<= 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; {11705#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:56:30,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {11705#(<= 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; {11706#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:30,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {11706#(<= 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; {11707#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:30,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {11707#(<= 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; {11708#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:30,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {11709#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {11709#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {11709#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {11709#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {11709#(<= 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; {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {11709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:56:30,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {11709#(<= 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; {11710#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:56:30,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {11710#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11700#false} is VALID [2022-04-15 12:56:30,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {11700#false} assume !(~z~0 % 4294967296 > 0); {11700#false} is VALID [2022-04-15 12:56:30,433 INFO L272 TraceCheckUtils]: 24: Hoare triple {11700#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11700#false} is VALID [2022-04-15 12:56:30,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {11700#false} ~cond := #in~cond; {11700#false} is VALID [2022-04-15 12:56:30,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {11700#false} assume 0 == ~cond; {11700#false} is VALID [2022-04-15 12:56:30,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {11700#false} assume !false; {11700#false} is VALID [2022-04-15 12:56:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:56:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:30,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65202310] [2022-04-15 12:56:30,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65202310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:30,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079782060] [2022-04-15 12:56:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:30,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:30,435 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-15 12:56:30,466 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-15 12:56:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:56:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:30,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:30,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {11699#true} call ULTIMATE.init(); {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {11699#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); {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {11699#true} assume true; {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11699#true} {11699#true} #83#return; {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {11699#true} call #t~ret15 := main(); {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {11699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {11699#true} [133] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11699#true} is VALID [2022-04-15 12:56:30,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {11699#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11699#true} is VALID [2022-04-15 12:56:30,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {11699#true} ~z~0 := ~y~0; {11699#true} is VALID [2022-04-15 12:56:30,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {11699#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; {11742#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {11742#(< 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; {11746#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {11746#(< 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; {11750#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {11750#(< 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; {11754#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:30,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {11754#(< 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; {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:30,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:30,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {11758#(< 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; {11754#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:30,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {11754#(< 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; {11750#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {11750#(< 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; {11746#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {11746#(< 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; {11742#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {11742#(< 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; {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {11777#(< 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; {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11700#false} is VALID [2022-04-15 12:56:30,840 INFO L272 TraceCheckUtils]: 24: Hoare triple {11700#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11700#false} is VALID [2022-04-15 12:56:30,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {11700#false} ~cond := #in~cond; {11700#false} is VALID [2022-04-15 12:56:30,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {11700#false} assume 0 == ~cond; {11700#false} is VALID [2022-04-15 12:56:30,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {11700#false} assume !false; {11700#false} is VALID [2022-04-15 12:56:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:30,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:30,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {11700#false} assume !false; {11700#false} is VALID [2022-04-15 12:56:30,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {11700#false} assume 0 == ~cond; {11700#false} is VALID [2022-04-15 12:56:30,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {11700#false} ~cond := #in~cond; {11700#false} is VALID [2022-04-15 12:56:30,945 INFO L272 TraceCheckUtils]: 24: Hoare triple {11700#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11700#false} is VALID [2022-04-15 12:56:30,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11700#false} is VALID [2022-04-15 12:56:30,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {11777#(< 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; {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {11777#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {11742#(< 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; {11777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:56:30,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {11746#(< 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; {11742#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {11750#(< 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; {11746#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {11754#(< 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; {11750#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {11758#(< 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; {11754#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:30,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:30,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {11754#(< 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; {11758#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:56:30,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {11750#(< 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; {11754#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:56:30,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {11746#(< 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; {11750#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:56:30,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {11742#(< 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; {11746#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {11699#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; {11742#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {11699#true} ~z~0 := ~y~0; {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {11699#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {11699#true} [133] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {11699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {11699#true} call #t~ret15 := main(); {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11699#true} {11699#true} #83#return; {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {11699#true} assume true; {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {11699#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); {11699#true} is VALID [2022-04-15 12:56:30,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {11699#true} call ULTIMATE.init(); {11699#true} is VALID [2022-04-15 12:56:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:30,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079782060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:30,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:30,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-15 12:56:31,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:31,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656304010] [2022-04-15 12:56:31,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656304010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:31,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:31,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:56:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589715530] [2022-04-15 12:56:31,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:31,216 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 30 [2022-04-15 12:56:31,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:31,216 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-15 12:56:31,260 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-15 12:56:31,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:56:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:56:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:56:31,261 INFO L87 Difference]: Start difference. First operand 74 states and 93 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-15 12:56:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,036 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2022-04-15 12:56:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:56:34,036 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 30 [2022-04-15 12:56:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:34,037 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-15 12:56:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-04-15 12:56:34,038 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-15 12:56:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-04-15 12:56:34,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 85 transitions. [2022-04-15 12:56:34,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:34,221 INFO L225 Difference]: With dead ends: 121 [2022-04-15 12:56:34,221 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 12:56:34,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:56:34,222 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 95 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:34,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 60 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:56:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 12:56:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2022-04-15 12:56:34,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:34,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,674 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,675 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,676 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-15 12:56:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2022-04-15 12:56:34,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:34,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:34,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 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 111 states. [2022-04-15 12:56:34,677 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 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 111 states. [2022-04-15 12:56:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:34,678 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-15 12:56:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2022-04-15 12:56:34,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:34,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:34,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:34,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2022-04-15 12:56:34,679 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 30 [2022-04-15 12:56:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:34,679 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2022-04-15 12:56:34,679 INFO L479 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-15 12:56:34,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 103 transitions. [2022-04-15 12:56:36,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2022-04-15 12:56:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:56:36,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:36,361 INFO L499 BasicCegarLoop]: 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-15 12:56:36,377 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-15 12:56:36,561 WARN L460 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-15 12:56:36,561 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 7 times [2022-04-15 12:56:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:36,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250006826] [2022-04-15 12:56:36,701 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 586029584, now seen corresponding path program 1 times [2022-04-15 12:56:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:36,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512362801] [2022-04-15 12:56:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:36,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {12558#(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); {12542#true} is VALID [2022-04-15 12:56:36,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {12542#true} assume true; {12542#true} is VALID [2022-04-15 12:56:36,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12542#true} {12542#true} #83#return; {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {12542#true} call ULTIMATE.init(); {12558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:36,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {12558#(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); {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {12542#true} assume true; {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12542#true} {12542#true} #83#return; {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {12542#true} call #t~ret15 := main(); {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {12542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {12542#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12542#true} is VALID [2022-04-15 12:56:36,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {12542#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12542#true} is VALID [2022-04-15 12:56:36,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {12542#true} ~z~0 := ~y~0; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:36,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:36,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12549#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:36,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {12549#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:36,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {12551#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:36,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {12551#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:36,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:36,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:36,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:36,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~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; {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:36,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:37,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {12555#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:37,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {12555#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {12555#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:37,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {12555#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 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; {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:37,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {12552#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:37,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {12553#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:37,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:37,009 INFO L272 TraceCheckUtils]: 25: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:56:37,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {12556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:56:37,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {12557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12543#false} is VALID [2022-04-15 12:56:37,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {12543#false} assume !false; {12543#false} is VALID [2022-04-15 12:56:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512362801] [2022-04-15 12:56:37,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512362801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436669739] [2022-04-15 12:56:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:37,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:37,012 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-15 12:56:37,013 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-15 12:56:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:37,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:56:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:37,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:37,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {12542#true} call ULTIMATE.init(); {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {12542#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); {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {12542#true} assume true; {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12542#true} {12542#true} #83#return; {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {12542#true} call #t~ret15 := main(); {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {12542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {12542#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {12542#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12542#true} is VALID [2022-04-15 12:56:37,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {12542#true} ~z~0 := ~y~0; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:37,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12549#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:37,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {12549#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:37,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:37,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {12550#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:37,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {12548#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ 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; {12604#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:56:37,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {12604#(and (<= (+ main_~y~0 1) 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; {12608#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:56:37,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {12608#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {12608#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:56:37,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {12608#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12615#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:56:37,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {12615#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 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; {12604#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:56:37,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#(and (<= (+ main_~y~0 1) main_~z~0) (<= 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; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~x~0 % 4294967296 > 0); {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 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; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 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; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 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; {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:37,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {12547#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:37,519 INFO L272 TraceCheckUtils]: 25: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:37,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {12640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:37,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12543#false} is VALID [2022-04-15 12:56:37,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {12543#false} assume !false; {12543#false} is VALID [2022-04-15 12:56:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:56:37,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:38,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {12543#false} assume !false; {12543#false} is VALID [2022-04-15 12:56:38,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12543#false} is VALID [2022-04-15 12:56:38,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {12640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:56:38,610 INFO L272 TraceCheckUtils]: 25: Hoare triple {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:56:38,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {12663#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12554#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:38,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {12667#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {12663#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:56:38,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {12671#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~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; {12667#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:38,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 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; {12671#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:38,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {12682#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 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; {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {12686#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967293) 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; {12682#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:38,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {12690#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 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; {12686#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:38,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {12690#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12690#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:38,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {12697#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {12690#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:56:38,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {12701#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 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; {12697#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:56:38,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {12705#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {12701#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:56:38,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {12705#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12705#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {12712#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {12705#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {12716#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {12712#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {12716#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {12542#true} ~z~0 := ~y~0; {12675#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {12542#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {12542#true} [135] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {12542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {12542#true} call #t~ret15 := main(); {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12542#true} {12542#true} #83#return; {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {12542#true} assume true; {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {12542#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); {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {12542#true} call ULTIMATE.init(); {12542#true} is VALID [2022-04-15 12:56:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:38,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436669739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:38,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:38,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2022-04-15 12:56:38,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:38,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250006826] [2022-04-15 12:56:38,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250006826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:38,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:38,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:56:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487834815] [2022-04-15 12:56:38,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:38,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:38,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:39,043 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-15 12:56:39,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:56:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:56:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:56:39,044 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:44,418 INFO L93 Difference]: Finished difference Result 142 states and 183 transitions. [2022-04-15 12:56:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:56:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 12:56:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 12:56:44,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-15 12:56:44,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:44,653 INFO L225 Difference]: With dead ends: 142 [2022-04-15 12:56:44,653 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:56:44,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:56:44,655 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:44,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 84 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:56:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:56:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-15 12:56:45,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:45,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:45,088 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:45,088 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:45,089 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2022-04-15 12:56:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-15 12:56:45,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:45,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:45,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:56:45,090 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:56:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:45,091 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2022-04-15 12:56:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-15 12:56:45,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:45,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:45,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:45,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-04-15 12:56:45,093 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 31 [2022-04-15 12:56:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:45,093 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-04-15 12:56:45,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 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-15 12:56:45,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 106 transitions. [2022-04-15 12:56:46,401 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-15 12:56:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-04-15 12:56:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:56:46,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:46,402 INFO L499 BasicCegarLoop]: 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-15 12:56:46,421 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-15 12:56:46,609 WARN L460 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-15 12:56:46,609 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 361612114, now seen corresponding path program 8 times [2022-04-15 12:56:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344245508] [2022-04-15 12:56:46,724 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -917908813, now seen corresponding path program 1 times [2022-04-15 12:56:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:46,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503183651] [2022-04-15 12:56:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:46,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {13444#(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); {13435#true} is VALID [2022-04-15 12:56:46,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {13435#true} assume true; {13435#true} is VALID [2022-04-15 12:56:46,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13435#true} {13435#true} #83#return; {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {13435#true} call ULTIMATE.init(); {13444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:46,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {13444#(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); {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {13435#true} assume true; {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13435#true} {13435#true} #83#return; {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {13435#true} call #t~ret15 := main(); {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {13435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13435#true} is VALID [2022-04-15 12:56:46,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {13435#true} [137] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13435#true} is VALID [2022-04-15 12:56:46,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {13435#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13435#true} is VALID [2022-04-15 12:56:46,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {13435#true} ~z~0 := ~y~0; {13435#true} is VALID [2022-04-15 12:56:46,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:46,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:46,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:46,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {13435#true} assume !(~z~0 % 4294967296 > 0); {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:46,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:46,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:46,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:46,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:46,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:46,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:46,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {13440#(<= 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; {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {13436#false} assume !(~z~0 % 4294967296 > 0); {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L272 TraceCheckUtils]: 26: Hoare triple {13436#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {13436#false} ~cond := #in~cond; {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {13436#false} assume 0 == ~cond; {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {13436#false} assume !false; {13436#false} is VALID [2022-04-15 12:56:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:56:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503183651] [2022-04-15 12:56:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503183651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221947279] [2022-04-15 12:56:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:46,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:46,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:46,892 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-15 12:56:46,913 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-15 12:56:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:46,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:56:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:46,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:47,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {13435#true} call ULTIMATE.init(); {13435#true} is VALID [2022-04-15 12:56:47,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {13435#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); {13435#true} is VALID [2022-04-15 12:56:47,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {13435#true} assume true; {13435#true} is VALID [2022-04-15 12:56:47,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13435#true} {13435#true} #83#return; {13435#true} is VALID [2022-04-15 12:56:47,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {13435#true} call #t~ret15 := main(); {13435#true} is VALID [2022-04-15 12:56:47,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {13435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {13435#true} [137] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {13435#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {13435#true} ~z~0 := ~y~0; {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {13435#true} assume !(~z~0 % 4294967296 > 0); {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:47,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:47,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:47,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:47,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:47,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:47,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {13440#(<= 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; {13436#false} is VALID [2022-04-15 12:56:47,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {13436#false} assume !(~z~0 % 4294967296 > 0); {13436#false} is VALID [2022-04-15 12:56:47,262 INFO L272 TraceCheckUtils]: 26: Hoare triple {13436#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13436#false} is VALID [2022-04-15 12:56:47,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {13436#false} ~cond := #in~cond; {13436#false} is VALID [2022-04-15 12:56:47,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {13436#false} assume 0 == ~cond; {13436#false} is VALID [2022-04-15 12:56:47,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {13436#false} assume !false; {13436#false} is VALID [2022-04-15 12:56:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:56:47,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:47,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {13436#false} assume !false; {13436#false} is VALID [2022-04-15 12:56:47,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {13436#false} assume 0 == ~cond; {13436#false} is VALID [2022-04-15 12:56:47,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {13436#false} ~cond := #in~cond; {13436#false} is VALID [2022-04-15 12:56:47,376 INFO L272 TraceCheckUtils]: 26: Hoare triple {13436#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13436#false} is VALID [2022-04-15 12:56:47,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {13436#false} assume !(~z~0 % 4294967296 > 0); {13436#false} is VALID [2022-04-15 12:56:47,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {13440#(<= 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; {13436#false} is VALID [2022-04-15 12:56:47,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:47,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:47,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:47,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {13443#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:47,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 12:56:47,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {13435#true} assume !(~z~0 % 4294967296 > 0); {13440#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {13435#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; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {13435#true} ~z~0 := ~y~0; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {13435#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {13435#true} [137] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {13435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {13435#true} call #t~ret15 := main(); {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13435#true} {13435#true} #83#return; {13435#true} is VALID [2022-04-15 12:56:47,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {13435#true} assume true; {13435#true} is VALID [2022-04-15 12:56:47,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {13435#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); {13435#true} is VALID [2022-04-15 12:56:47,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {13435#true} call ULTIMATE.init(); {13435#true} is VALID [2022-04-15 12:56:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:56:47,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221947279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:47,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:47,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-15 12:56:47,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344245508] [2022-04-15 12:56:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344245508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:47,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:56:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330507476] [2022-04-15 12:56:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 32 [2022-04-15 12:56:47,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:47,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-15 12:56:47,601 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-15 12:56:47,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:56:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:47,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:56:47,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:56:47,602 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-15 12:56:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:49,785 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 12:56:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:56:49,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 32 [2022-04-15 12:56:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-15 12:56:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2022-04-15 12:56:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-15 12:56:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2022-04-15 12:56:49,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 52 transitions. [2022-04-15 12:56:49,975 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-15 12:56:49,976 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:56:49,976 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:56:49,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:56:49,977 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:49,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:56:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:56:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-04-15 12:56:50,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:50,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:50,298 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:50,298 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:50,299 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-15 12:56:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-15 12:56:50,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:50,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:50,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 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 71 states. [2022-04-15 12:56:50,299 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 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 71 states. [2022-04-15 12:56:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:50,300 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-15 12:56:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-15 12:56:50,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:50,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:50,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:50,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-04-15 12:56:50,302 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 32 [2022-04-15 12:56:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:50,302 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-04-15 12:56:50,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-15 12:56:50,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 88 transitions. [2022-04-15 12:56:53,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 87 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-04-15 12:56:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:56:53,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:53,825 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:53,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:54,025 WARN L460 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-15 12:56:54,026 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 93956866, now seen corresponding path program 12 times [2022-04-15 12:56:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:54,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779712776] [2022-04-15 12:56:54,171 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -515496978, now seen corresponding path program 1 times [2022-04-15 12:56:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:54,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651659362] [2022-04-15 12:56:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:54,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {14135#(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); {14122#true} is VALID [2022-04-15 12:56:54,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {14122#true} assume true; {14122#true} is VALID [2022-04-15 12:56:54,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14122#true} {14122#true} #83#return; {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {14122#true} call ULTIMATE.init(); {14135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:54,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {14135#(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); {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {14122#true} assume true; {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14122#true} {14122#true} #83#return; {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {14122#true} call #t~ret15 := main(); {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {14122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {14122#true} [139] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14122#true} is VALID [2022-04-15 12:56:54,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {14122#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14122#true} is VALID [2022-04-15 12:56:54,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {14122#true} ~z~0 := ~y~0; {14122#true} is VALID [2022-04-15 12:56:54,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {14122#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; {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {14128#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:54,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {14128#(<= main_~z~0 (+ (* (div main_~z~0 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; {14129#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {14129#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {14130#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {14130#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14130#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {14130#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14131#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {14131#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) 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; {14132#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 12:56:54,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {14132#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14133#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {14133#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 12:56:54,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {14134#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {14123#false} is VALID [2022-04-15 12:56:54,388 INFO L272 TraceCheckUtils]: 25: Hoare triple {14123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14123#false} is VALID [2022-04-15 12:56:54,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {14123#false} ~cond := #in~cond; {14123#false} is VALID [2022-04-15 12:56:54,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {14123#false} assume 0 == ~cond; {14123#false} is VALID [2022-04-15 12:56:54,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {14123#false} assume !false; {14123#false} is VALID [2022-04-15 12:56:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:56:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:54,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651659362] [2022-04-15 12:56:54,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651659362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110790216] [2022-04-15 12:56:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:54,392 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-15 12:56:54,399 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-15 12:56:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:54,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:56:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:54,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:54,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {14122#true} call ULTIMATE.init(); {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {14122#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); {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {14122#true} assume true; {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14122#true} {14122#true} #83#return; {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {14122#true} call #t~ret15 := main(); {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {14122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {14122#true} [139] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14122#true} is VALID [2022-04-15 12:56:54,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {14122#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14122#true} is VALID [2022-04-15 12:56:54,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {14122#true} ~z~0 := ~y~0; {14122#true} is VALID [2022-04-15 12:56:54,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {14122#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; {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:54,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {14169#(<= main_~z~0 (+ (* (div (+ main_~z~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; {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:54,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:54,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:54,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14123#false} is VALID [2022-04-15 12:56:54,857 INFO L272 TraceCheckUtils]: 25: Hoare triple {14123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14123#false} is VALID [2022-04-15 12:56:54,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {14123#false} ~cond := #in~cond; {14123#false} is VALID [2022-04-15 12:56:54,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {14123#false} assume 0 == ~cond; {14123#false} is VALID [2022-04-15 12:56:54,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {14123#false} assume !false; {14123#false} is VALID [2022-04-15 12:56:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:56:54,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:55,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {14123#false} assume !false; {14123#false} is VALID [2022-04-15 12:56:55,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {14123#false} assume 0 == ~cond; {14123#false} is VALID [2022-04-15 12:56:55,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {14123#false} ~cond := #in~cond; {14123#false} is VALID [2022-04-15 12:56:55,014 INFO L272 TraceCheckUtils]: 25: Hoare triple {14123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14123#false} is VALID [2022-04-15 12:56:55,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14123#false} is VALID [2022-04-15 12:56:55,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14193#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:55,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:55,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {14177#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {14169#(<= main_~z~0 (+ (* (div (+ main_~z~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; {14173#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {14169#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {14122#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; {14127#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {14122#true} ~z~0 := ~y~0; {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {14122#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {14122#true} [139] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {14122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {14122#true} call #t~ret15 := main(); {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14122#true} {14122#true} #83#return; {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {14122#true} assume true; {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {14122#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); {14122#true} is VALID [2022-04-15 12:56:55,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {14122#true} call ULTIMATE.init(); {14122#true} is VALID [2022-04-15 12:56:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:56:55,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110790216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:55,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:55,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-15 12:56:55,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779712776] [2022-04-15 12:56:55,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779712776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:55,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:55,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:56:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801569705] [2022-04-15 12:56:55,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:55,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 32 [2022-04-15 12:56:55,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:55,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 12:56:55,401 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-15 12:56:55,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:56:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:56:55,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:56:55,402 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 12:57:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:00,208 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2022-04-15 12:57:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:57:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 32 [2022-04-15 12:57:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 12:57:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-15 12:57:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 12:57:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-15 12:57:00,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2022-04-15 12:57:00,516 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-15 12:57:00,519 INFO L225 Difference]: With dead ends: 97 [2022-04-15 12:57:00,519 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 12:57:00,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=1370, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:57:00,521 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:00,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:57:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 12:57:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2022-04-15 12:57:00,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:00,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:00,930 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:00,930 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:00,932 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-15 12:57:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-15 12:57:00,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:00,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:00,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 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-15 12:57:00,932 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 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-15 12:57:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:00,934 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-04-15 12:57:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-04-15 12:57:00,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:00,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:00,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:00,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-15 12:57:00,935 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 32 [2022-04-15 12:57:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:00,935 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-15 12:57:00,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 12:57:00,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 98 transitions. [2022-04-15 12:57:03,062 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-15 12:57:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-15 12:57:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:57:03,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:03,063 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:03,079 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-15 12:57:03,271 WARN L460 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-15 12:57:03,271 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2035160497, now seen corresponding path program 13 times [2022-04-15 12:57:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:03,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688545601] [2022-04-15 12:57:03,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -160876963, now seen corresponding path program 1 times [2022-04-15 12:57:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:03,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248939018] [2022-04-15 12:57:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:03,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {14913#(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); {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {14896#true} assume true; {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14896#true} {14896#true} #83#return; {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {14896#true} call ULTIMATE.init(); {14913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {14913#(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); {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {14896#true} assume true; {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14896#true} {14896#true} #83#return; {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {14896#true} call #t~ret15 := main(); {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {14896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {14896#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14896#true} is VALID [2022-04-15 12:57:03,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {14896#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14896#true} is VALID [2022-04-15 12:57:03,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {14896#true} ~z~0 := ~y~0; {14901#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:03,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {14901#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14902#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:03,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {14902#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14903#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:03,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {14903#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14904#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:03,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {14904#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14905#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:03,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {14905#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {14906#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:03,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {14906#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {14907#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:03,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {14907#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14907#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:03,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {14907#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {14908#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:03,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {14908#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14909#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:03,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {14909#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14910#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:03,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {14910#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14911#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:03,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {14911#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14912#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {14912#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {14897#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; {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {14897#false} assume !(~x~0 % 4294967296 > 0); {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {14897#false} assume !(~z~0 % 4294967296 > 0); {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L272 TraceCheckUtils]: 25: Hoare triple {14897#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {14897#false} ~cond := #in~cond; {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {14897#false} assume 0 == ~cond; {14897#false} is VALID [2022-04-15 12:57:03,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#false} assume !false; {14897#false} is VALID [2022-04-15 12:57:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248939018] [2022-04-15 12:57:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248939018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407712072] [2022-04-15 12:57:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:03,815 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-15 12:57:03,815 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-15 12:57:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:03,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:57:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:03,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:04,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {14896#true} call ULTIMATE.init(); {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {14896#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); {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {14896#true} assume true; {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14896#true} {14896#true} #83#return; {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {14896#true} call #t~ret15 := main(); {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {14896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {14896#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14896#true} is VALID [2022-04-15 12:57:04,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {14896#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14896#true} is VALID [2022-04-15 12:57:04,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {14896#true} ~z~0 := ~y~0; {14901#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:04,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {14901#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14902#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:04,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {14902#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14947#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:04,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {14947#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14951#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:04,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {14951#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14955#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:04,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {14955#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~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; {14959#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:04,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {14959#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0) (< 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; {14963#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:57:04,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {14963#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {14963#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:57:04,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {14963#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14970#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:04,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {14970#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 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; {14974#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:04,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {14974#(< 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; {14978#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:04,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {14978#(< 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; {14982#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:04,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {14982#(< 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; {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {14986#(< 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; {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14897#false} is VALID [2022-04-15 12:57:04,704 INFO L272 TraceCheckUtils]: 25: Hoare triple {14897#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14897#false} is VALID [2022-04-15 12:57:04,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {14897#false} ~cond := #in~cond; {14897#false} is VALID [2022-04-15 12:57:04,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {14897#false} assume 0 == ~cond; {14897#false} is VALID [2022-04-15 12:57:04,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#false} assume !false; {14897#false} is VALID [2022-04-15 12:57:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:04,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:04,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#false} assume !false; {14897#false} is VALID [2022-04-15 12:57:04,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {14897#false} assume 0 == ~cond; {14897#false} is VALID [2022-04-15 12:57:04,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {14897#false} ~cond := #in~cond; {14897#false} is VALID [2022-04-15 12:57:04,938 INFO L272 TraceCheckUtils]: 25: Hoare triple {14897#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14897#false} is VALID [2022-04-15 12:57:04,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14897#false} is VALID [2022-04-15 12:57:04,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {14986#(< 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; {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {14986#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {14982#(< 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; {14986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:04,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {14978#(< 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; {14982#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:04,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {14974#(< 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; {14978#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:04,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {15044#(< 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; {14974#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:04,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {15048#(< 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; {15044#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:04,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {15048#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {15048#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:57:04,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {15044#(< 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; {15048#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:57:04,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {14974#(< 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; {15044#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:04,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {14978#(< 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; {14974#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:04,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {14982#(< 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; {14978#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:04,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {14896#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; {14982#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {14896#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; {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {14896#true} ~z~0 := ~y~0; {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {14896#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {14896#true} [141] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {14896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {14896#true} call #t~ret15 := main(); {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14896#true} {14896#true} #83#return; {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {14896#true} assume true; {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {14896#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); {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {14896#true} call ULTIMATE.init(); {14896#true} is VALID [2022-04-15 12:57:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:57:04,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407712072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:04,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:04,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 8] total 27 [2022-04-15 12:57:05,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:05,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688545601] [2022-04-15 12:57:05,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688545601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:05,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:05,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:57:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603289827] [2022-04-15 12:57:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:05,773 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-15 12:57:05,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:05,773 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-15 12:57:05,866 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-15 12:57:05,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:57:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:05,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:57:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:57:05,867 INFO L87 Difference]: Start difference. First operand 77 states and 98 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-15 12:57:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:24,926 INFO L93 Difference]: Finished difference Result 155 states and 205 transitions. [2022-04-15 12:57:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 12:57:24,926 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-15 12:57:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:24,926 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-15 12:57:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 132 transitions. [2022-04-15 12:57:24,928 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-15 12:57:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 132 transitions. [2022-04-15 12:57:24,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 132 transitions. [2022-04-15 12:57:26,031 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-15 12:57:26,032 INFO L225 Difference]: With dead ends: 155 [2022-04-15 12:57:26,032 INFO L226 Difference]: Without dead ends: 127 [2022-04-15 12:57:26,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=789, Invalid=5531, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:57:26,034 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 141 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:26,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 84 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 12:57:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-15 12:57:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2022-04-15 12:57:26,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:26,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 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-15 12:57:26,537 INFO L74 IsIncluded]: Start isIncluded. First operand 127 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-15 12:57:26,537 INFO L87 Difference]: Start difference. First operand 127 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-15 12:57:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:26,538 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2022-04-15 12:57:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-15 12:57:26,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:26,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:26,538 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 127 states. [2022-04-15 12:57:26,539 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 127 states. [2022-04-15 12:57:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:26,540 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2022-04-15 12:57:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-15 12:57:26,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:26,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:26,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:26,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:26,541 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-15 12:57:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2022-04-15 12:57:26,542 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 32 [2022-04-15 12:57:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:26,542 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2022-04-15 12:57:26,542 INFO L479 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-15 12:57:26,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 111 transitions. [2022-04-15 12:57:29,239 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-15 12:57:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2022-04-15 12:57:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:57:29,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:29,240 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:29,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:29,440 WARN L460 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-15 12:57:29,440 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash -398850032, now seen corresponding path program 14 times [2022-04-15 12:57:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:29,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235150824] [2022-04-15 12:57:29,585 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1695986396, now seen corresponding path program 1 times [2022-04-15 12:57:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724101145] [2022-04-15 12:57:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:29,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {15957#(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); {15944#true} is VALID [2022-04-15 12:57:29,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {15944#true} assume true; {15944#true} is VALID [2022-04-15 12:57:29,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15944#true} {15944#true} #83#return; {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {15944#true} call ULTIMATE.init(); {15957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:29,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {15957#(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); {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {15944#true} assume true; {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15944#true} {15944#true} #83#return; {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {15944#true} call #t~ret15 := main(); {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {15944#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15944#true} is VALID [2022-04-15 12:57:29,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {15944#true} [143] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15944#true} is VALID [2022-04-15 12:57:29,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {15944#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15949#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:29,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {15949#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15949#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:29,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {15949#(<= 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; {15950#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:57:29,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#(<= 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; {15951#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {15951#(<= 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; {15952#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {15952#(<= 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; {15953#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {15953#(<= 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; {15954#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:29,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {15954#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:29,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {15955#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15956#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:57:29,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {15956#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15945#false} is VALID [2022-04-15 12:57:29,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {15945#false} assume !(~z~0 % 4294967296 > 0); {15945#false} is VALID [2022-04-15 12:57:29,914 INFO L272 TraceCheckUtils]: 26: Hoare triple {15945#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15945#false} is VALID [2022-04-15 12:57:29,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {15945#false} ~cond := #in~cond; {15945#false} is VALID [2022-04-15 12:57:29,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {15945#false} assume 0 == ~cond; {15945#false} is VALID [2022-04-15 12:57:29,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {15945#false} assume !false; {15945#false} is VALID [2022-04-15 12:57:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 12:57:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:29,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724101145] [2022-04-15 12:57:29,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724101145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:29,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795591947] [2022-04-15 12:57:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:29,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:29,918 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-15 12:57:29,921 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-15 12:57:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:29,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:57:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:29,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:31,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {15944#true} call ULTIMATE.init(); {15944#true} is VALID [2022-04-15 12:57:31,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {15944#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); {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {15944#true} assume true; {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15944#true} {15944#true} #83#return; {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {15944#true} call #t~ret15 := main(); {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {15944#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {15944#true} [143] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {15944#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15944#true} is VALID [2022-04-15 12:57:31,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {15944#true} ~z~0 := ~y~0; {15985#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:57:31,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {15985#(= 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; {15989#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {15989#(and (= main_~y~0 (+ main_~z~0 1)) (< 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; {15993#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {15993#(and (= main_~y~0 (+ main_~z~0 2)) (< 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; {15997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {15997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 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; {16001#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {16001#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (< 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; {16005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {16005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (< 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; {16009#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {16009#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16009#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:57:31,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {16009#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (< 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; {16016#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) main_~z~0))} is VALID [2022-04-15 12:57:31,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {16016#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ main_~y~0 (- 4)) 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; {16020#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:57:31,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(and (= (+ main_~z~0 3) (+ main_~y~0 1)) (< 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; {16024#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-15 12:57:31,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {16024#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~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; {16028#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-15 12:57:31,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {16028#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 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; {16032#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~0 2) (+ (- 2) main_~z~0)))} is VALID [2022-04-15 12:57:31,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {16032#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~y~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; {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {16036#(< 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; {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15945#false} is VALID [2022-04-15 12:57:31,060 INFO L272 TraceCheckUtils]: 26: Hoare triple {15945#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15945#false} is VALID [2022-04-15 12:57:31,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {15945#false} ~cond := #in~cond; {15945#false} is VALID [2022-04-15 12:57:31,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {15945#false} assume 0 == ~cond; {15945#false} is VALID [2022-04-15 12:57:31,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {15945#false} assume !false; {15945#false} is VALID [2022-04-15 12:57:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:31,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:31,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {15945#false} assume !false; {15945#false} is VALID [2022-04-15 12:57:31,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {15945#false} assume 0 == ~cond; {15945#false} is VALID [2022-04-15 12:57:31,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {15945#false} ~cond := #in~cond; {15945#false} is VALID [2022-04-15 12:57:31,740 INFO L272 TraceCheckUtils]: 26: Hoare triple {15945#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15945#false} is VALID [2022-04-15 12:57:31,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15945#false} is VALID [2022-04-15 12:57:31,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {16036#(< 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; {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {16036#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {16085#(< 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; {16036#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:57:31,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {16089#(< 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; {16085#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:31,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {16093#(< 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; {16089#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:31,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {16097#(< 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; {16093#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:31,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {16101#(< 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; {16097#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:31,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {16105#(< 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; {16101#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:57:31,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {16105#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {16105#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:57:31,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {16101#(< 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; {16105#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:57:31,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {16097#(< 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; {16101#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:57:31,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {16093#(< 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; {16097#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:57:31,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {16089#(< 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; {16093#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:57:31,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {16085#(< 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; {16089#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {15944#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; {16085#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {15944#true} ~z~0 := ~y~0; {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {15944#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {15944#true} [143] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {15944#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {15944#true} call #t~ret15 := main(); {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15944#true} {15944#true} #83#return; {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {15944#true} assume true; {15944#true} is VALID [2022-04-15 12:57:31,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {15944#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); {15944#true} is VALID [2022-04-15 12:57:31,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {15944#true} call ULTIMATE.init(); {15944#true} is VALID [2022-04-15 12:57:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:31,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795591947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:31,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:31,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 9] total 30 [2022-04-15 12:57:32,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235150824] [2022-04-15 12:57:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235150824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:32,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:32,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:57:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538895811] [2022-04-15 12:57:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:32,755 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 33 [2022-04-15 12:57:32,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:32,755 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-15 12:57:32,831 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-15 12:57:32,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:57:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:57:32,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:57:32,832 INFO L87 Difference]: Start difference. First operand 88 states and 111 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-15 12:57:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:38,513 INFO L93 Difference]: Finished difference Result 153 states and 201 transitions. [2022-04-15 12:57:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:57:38,514 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 33 [2022-04-15 12:57:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:38,514 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-15 12:57:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-04-15 12:57:38,515 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-15 12:57:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-04-15 12:57:38,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 97 transitions. [2022-04-15 12:57:38,938 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-15 12:57:38,939 INFO L225 Difference]: With dead ends: 153 [2022-04-15 12:57:38,939 INFO L226 Difference]: Without dead ends: 142 [2022-04-15 12:57:38,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=287, Invalid=2163, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:57:38,940 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 132 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:38,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 35 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:57:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-15 12:57:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2022-04-15 12:57:39,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:39,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:39,509 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:39,509 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:39,511 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 12:57:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 12:57:39,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:39,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:39,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 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 142 states. [2022-04-15 12:57:39,512 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 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 142 states. [2022-04-15 12:57:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:39,514 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 12:57:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 12:57:39,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:39,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:39,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:39,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2022-04-15 12:57:39,516 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 33 [2022-04-15 12:57:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:39,516 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2022-04-15 12:57:39,516 INFO L479 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-15 12:57:39,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 124 transitions. [2022-04-15 12:57:42,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2022-04-15 12:57:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:57:42,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:42,686 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:42,703 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-15 12:57:42,886 WARN L460 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-15 12:57:42,886 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:42,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1273237790, now seen corresponding path program 15 times [2022-04-15 12:57:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:42,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530315694] [2022-04-15 12:57:43,035 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1471742990, now seen corresponding path program 1 times [2022-04-15 12:57:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737866254] [2022-04-15 12:57:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:43,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {16993#(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); {16978#true} is VALID [2022-04-15 12:57:43,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-15 12:57:43,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16978#true} {16978#true} #83#return; {16978#true} is VALID [2022-04-15 12:57:43,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:43,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {16993#(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); {16978#true} is VALID [2022-04-15 12:57:43,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-15 12:57:43,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #83#return; {16978#true} is VALID [2022-04-15 12:57:43,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret15 := main(); {16978#true} is VALID [2022-04-15 12:57:43,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16978#true} is VALID [2022-04-15 12:57:43,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {16978#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16978#true} is VALID [2022-04-15 12:57:43,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {16978#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16978#true} is VALID [2022-04-15 12:57:43,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {16978#true} ~z~0 := ~y~0; {16983#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:43,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {16983#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16984#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:43,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {16984#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16985#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:43,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {16985#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16986#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:43,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {16986#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16987#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:43,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {16987#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16988#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 12:57:43,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {16988#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 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; {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:43,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:43,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:43,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {16979#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {16979#false} assume !(~y~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {16979#false} assume !(~x~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {16979#false} assume !(~z~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,434 INFO L272 TraceCheckUtils]: 27: Hoare triple {16979#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16979#false} is VALID [2022-04-15 12:57:43,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {16979#false} ~cond := #in~cond; {16979#false} is VALID [2022-04-15 12:57:43,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {16979#false} assume 0 == ~cond; {16979#false} is VALID [2022-04-15 12:57:43,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-15 12:57:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:57:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:43,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737866254] [2022-04-15 12:57:43,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737866254] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:43,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562112336] [2022-04-15 12:57:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:43,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:43,440 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-15 12:57:43,441 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-15 12:57:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:43,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:57:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:43,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:43,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16978#true} is VALID [2022-04-15 12:57:43,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#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); {16978#true} is VALID [2022-04-15 12:57:43,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-15 12:57:43,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #83#return; {16978#true} is VALID [2022-04-15 12:57:43,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret15 := main(); {16978#true} is VALID [2022-04-15 12:57:43,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16978#true} is VALID [2022-04-15 12:57:43,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {16978#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16978#true} is VALID [2022-04-15 12:57:43,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {16978#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16978#true} is VALID [2022-04-15 12:57:43,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {16978#true} ~z~0 := ~y~0; {16983#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:43,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {16983#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16984#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:43,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {16984#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16985#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:43,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {16985#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16986#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:43,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {16986#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16987#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:43,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {16987#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {17036#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 12:57:43,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {17036#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~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; {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:43,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:43,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:43,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {16979#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {16979#false} assume !(~y~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:43,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {16979#false} assume !(~x~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {16979#false} assume !(~z~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L272 TraceCheckUtils]: 27: Hoare triple {16979#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {16979#false} ~cond := #in~cond; {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {16979#false} assume 0 == ~cond; {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-15 12:57:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:57:43,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:44,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {16979#false} assume 0 == ~cond; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {16979#false} ~cond := #in~cond; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L272 TraceCheckUtils]: 27: Hoare triple {16979#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {16979#false} assume !(~z~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {16979#false} assume !(~x~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {16979#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; {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {16979#false} assume !(~y~0 % 4294967296 > 0); {16979#false} is VALID [2022-04-15 12:57:44,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {16979#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:44,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16979#false} is VALID [2022-04-15 12:57:44,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16992#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:57:44,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16991#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:57:44,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16990#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:44,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {17036#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~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; {16989#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:44,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {17139#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17036#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 12:57:44,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {17143#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {17139#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:57:44,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {17147#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {17143#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:57:44,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {17151#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {17147#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:57:44,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {17155#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {17151#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:57:44,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {16978#true} ~z~0 := ~y~0; {17155#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:57:44,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {16978#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16978#true} is VALID [2022-04-15 12:57:44,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {16978#true} [145] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16978#true} is VALID [2022-04-15 12:57:44,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16978#true} is VALID [2022-04-15 12:57:44,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret15 := main(); {16978#true} is VALID [2022-04-15 12:57:44,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #83#return; {16978#true} is VALID [2022-04-15 12:57:44,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-15 12:57:44,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#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); {16978#true} is VALID [2022-04-15 12:57:44,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16978#true} is VALID [2022-04-15 12:57:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:57:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562112336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:44,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-15 12:57:45,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530315694] [2022-04-15 12:57:45,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530315694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:45,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:45,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:57:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555158237] [2022-04-15 12:57:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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 34 [2022-04-15 12:57:45,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:45,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 12:57:45,465 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-15 12:57:45,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:57:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:57:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:57:45,466 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 12:57:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:55,468 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-15 12:57:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:57:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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 34 [2022-04-15 12:57:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 12:57:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2022-04-15 12:57:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 12:57:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2022-04-15 12:57:55,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 65 transitions. [2022-04-15 12:57:55,761 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-15 12:57:55,762 INFO L225 Difference]: With dead ends: 117 [2022-04-15 12:57:55,763 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 12:57:55,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=206, Invalid=1434, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:57:55,763 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:55,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 85 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 12:57:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 12:57:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-04-15 12:57:56,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:56,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:56,337 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:56,337 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:56,339 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-15 12:57:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-04-15 12:57:56,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:56,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:56,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 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 104 states. [2022-04-15 12:57:56,339 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 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 104 states. [2022-04-15 12:57:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:56,341 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-15 12:57:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-04-15 12:57:56,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:56,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:56,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:56,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-04-15 12:57:56,343 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 34 [2022-04-15 12:57:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:56,343 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-04-15 12:57:56,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 12:57:56,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 120 transitions. [2022-04-15 12:57:58,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-04-15 12:57:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:57:58,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:58,981 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:58,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:59,183 WARN L460 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-15 12:57:59,183 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1983137790, now seen corresponding path program 16 times [2022-04-15 12:57:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2064128614] [2022-04-15 12:57:59,329 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 768378094, now seen corresponding path program 1 times [2022-04-15 12:57:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:59,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756845856] [2022-04-15 12:57:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:59,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {17880#(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); {17861#true} is VALID [2022-04-15 12:57:59,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {17861#true} assume true; {17861#true} is VALID [2022-04-15 12:57:59,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17861#true} {17861#true} #83#return; {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {17861#true} call ULTIMATE.init(); {17880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:59,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {17880#(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); {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {17861#true} assume true; {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17861#true} {17861#true} #83#return; {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {17861#true} call #t~ret15 := main(); {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {17861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {17861#true} [147] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17861#true} is VALID [2022-04-15 12:57:59,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {17861#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17861#true} is VALID [2022-04-15 12:57:59,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {17861#true} ~z~0 := ~y~0; {17866#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:57:59,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17867#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:59,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17868#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:59,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17869#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:59,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17870#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:59,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {17871#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:59,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {17872#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:57:59,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:57:59,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:57:59,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:59,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:59,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:59,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:59,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:59,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:59,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:57:59,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {17862#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; {17862#false} is VALID [2022-04-15 12:57:59,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {17862#false} assume !(~x~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {17862#false} assume !(~z~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L272 TraceCheckUtils]: 27: Hoare triple {17862#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {17862#false} ~cond := #in~cond; {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {17862#false} assume 0 == ~cond; {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {17862#false} assume !false; {17862#false} is VALID [2022-04-15 12:57:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756845856] [2022-04-15 12:57:59,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756845856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502305479] [2022-04-15 12:57:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:59,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:59,878 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-15 12:57:59,878 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-15 12:57:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:59,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:57:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:59,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:00,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {17861#true} call ULTIMATE.init(); {17861#true} is VALID [2022-04-15 12:58:00,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {17861#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); {17861#true} is VALID [2022-04-15 12:58:00,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {17861#true} assume true; {17861#true} is VALID [2022-04-15 12:58:00,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17861#true} {17861#true} #83#return; {17861#true} is VALID [2022-04-15 12:58:00,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {17861#true} call #t~ret15 := main(); {17861#true} is VALID [2022-04-15 12:58:00,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {17861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17861#true} is VALID [2022-04-15 12:58:00,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {17861#true} [147] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17861#true} is VALID [2022-04-15 12:58:00,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {17861#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17861#true} is VALID [2022-04-15 12:58:00,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {17861#true} ~z~0 := ~y~0; {17866#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:58:00,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17867#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:58:00,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17868#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:58:00,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17869#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:58:00,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17870#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:58:00,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {17871#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:58:00,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {17872#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:58:00,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:58:00,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:58:00,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:58:00,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:58:00,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:58:00,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:58:00,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:00,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:00,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:00,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {17862#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; {17862#false} is VALID [2022-04-15 12:58:00,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {17862#false} assume !(~x~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:00,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {17862#false} assume !(~z~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:00,504 INFO L272 TraceCheckUtils]: 27: Hoare triple {17862#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17862#false} is VALID [2022-04-15 12:58:00,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {17862#false} ~cond := #in~cond; {17862#false} is VALID [2022-04-15 12:58:00,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {17862#false} assume 0 == ~cond; {17862#false} is VALID [2022-04-15 12:58:00,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {17862#false} assume !false; {17862#false} is VALID [2022-04-15 12:58:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:00,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:01,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {17862#false} assume !false; {17862#false} is VALID [2022-04-15 12:58:01,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {17862#false} assume 0 == ~cond; {17862#false} is VALID [2022-04-15 12:58:01,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {17862#false} ~cond := #in~cond; {17862#false} is VALID [2022-04-15 12:58:01,374 INFO L272 TraceCheckUtils]: 27: Hoare triple {17862#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {17862#false} is VALID [2022-04-15 12:58:01,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {17862#false} assume !(~z~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:01,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {17862#false} assume !(~x~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:01,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {17862#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; {17862#false} is VALID [2022-04-15 12:58:01,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {17862#false} is VALID [2022-04-15 12:58:01,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17879#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:58:01,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17878#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:58:01,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17877#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:58:01,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17876#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:58:01,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {17875#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:58:01,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17874#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:58:01,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:58:01,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {18019#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17873#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:58:01,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {18023#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18019#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:58:01,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {18027#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18023#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:58:01,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {18031#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18027#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:58:01,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {18035#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18031#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:58:01,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {18039#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 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; {18035#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:58:01,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {18043#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 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; {18039#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:01,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {17861#true} ~z~0 := ~y~0; {18043#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:58:01,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {17861#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {17861#true} [147] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {17861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {17861#true} call #t~ret15 := main(); {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17861#true} {17861#true} #83#return; {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {17861#true} assume true; {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {17861#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); {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {17861#true} call ULTIMATE.init(); {17861#true} is VALID [2022-04-15 12:58:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502305479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:01,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:01,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 12:58:02,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2064128614] [2022-04-15 12:58:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2064128614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:02,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:58:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274003321] [2022-04-15 12:58:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:02,422 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-15 12:58:02,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:02,422 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-15 12:58:02,505 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-15 12:58:02,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:58:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:58:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:58:02,506 INFO L87 Difference]: Start difference. First operand 96 states and 120 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-15 12:58:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:44,305 INFO L93 Difference]: Finished difference Result 194 states and 257 transitions. [2022-04-15 12:58:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 12:58:44,305 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-15 12:58:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:44,306 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-15 12:58:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 177 transitions. [2022-04-15 12:58:44,308 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-15 12:58:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 177 transitions. [2022-04-15 12:58:44,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 177 transitions. [2022-04-15 12:58:47,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:47,453 INFO L225 Difference]: With dead ends: 194 [2022-04-15 12:58:47,453 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 12:58:47,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=1372, Invalid=8330, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:58:47,455 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 171 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:47,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 103 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-15 12:58:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 12:58:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2022-04-15 12:58:48,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:48,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,138 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,138 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:48,140 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2022-04-15 12:58:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2022-04-15 12:58:48,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:48,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:48,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 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 164 states. [2022-04-15 12:58:48,141 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 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 164 states. [2022-04-15 12:58:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:48,144 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2022-04-15 12:58:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2022-04-15 12:58:48,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:48,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:48,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:48,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-15 12:58:48,146 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 34 [2022-04-15 12:58:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:48,146 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-15 12:58:48,146 INFO L479 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-15 12:58:48,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 137 transitions. [2022-04-15 12:58:53,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-15 12:58:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:58:53,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:53,667 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:53,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 12:58:53,867 WARN L460 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-15 12:58:53,867 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -412045345, now seen corresponding path program 17 times [2022-04-15 12:58:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890168605] [2022-04-15 12:58:54,017 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash -811810637, now seen corresponding path program 1 times [2022-04-15 12:58:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:54,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371815460] [2022-04-15 12:58:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {19171#(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); {19157#true} is VALID [2022-04-15 12:58:54,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {19157#true} assume true; {19157#true} is VALID [2022-04-15 12:58:54,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19157#true} {19157#true} #83#return; {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {19157#true} call ULTIMATE.init(); {19171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:54,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {19171#(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); {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {19157#true} assume true; {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19157#true} {19157#true} #83#return; {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {19157#true} call #t~ret15 := main(); {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {19157#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19157#true} is VALID [2022-04-15 12:58:54,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {19157#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19157#true} is VALID [2022-04-15 12:58:54,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {19157#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19162#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:54,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {19162#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {19162#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:54,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {19162#(<= 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; {19163#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:54,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {19163#(<= 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; {19164#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {19164#(<= 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; {19165#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {19165#(<= 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; {19166#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {19166#(<= 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; {19167#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:54,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {19167#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {19168#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {19168#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:54,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {19169#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {19170#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:58:54,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {19170#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {19158#false} assume !(~z~0 % 4294967296 > 0); {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L272 TraceCheckUtils]: 28: Hoare triple {19158#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {19158#false} ~cond := #in~cond; {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {19158#false} assume 0 == ~cond; {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {19158#false} assume !false; {19158#false} is VALID [2022-04-15 12:58:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:58:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:54,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371815460] [2022-04-15 12:58:54,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371815460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:54,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591756731] [2022-04-15 12:58:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:54,640 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-15 12:58:54,643 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-15 12:58:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:58:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:55,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {19157#true} call ULTIMATE.init(); {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {19157#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); {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {19157#true} assume true; {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19157#true} {19157#true} #83#return; {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {19157#true} call #t~ret15 := main(); {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {19157#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {19157#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {19157#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19157#true} is VALID [2022-04-15 12:58:55,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {19157#true} ~z~0 := ~y~0; {19157#true} is VALID [2022-04-15 12:58:55,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {19157#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; {19202#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:55,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {19202#(< 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; {19206#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:55,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {19206#(< 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; {19210#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:55,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {19210#(< 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; {19214#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:55,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {19214#(< 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; {19218#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {19218#(< 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; {19222#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:58:55,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {19222#(< 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; {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {19226#(< 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; {19222#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:58:55,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {19222#(< 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; {19218#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {19218#(< 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; {19214#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:55,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {19214#(< 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; {19210#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:55,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {19210#(< 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; {19206#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:55,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {19206#(< 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; {19202#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:55,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {19202#(< 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; {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {19251#(< 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; {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19158#false} is VALID [2022-04-15 12:58:55,566 INFO L272 TraceCheckUtils]: 28: Hoare triple {19158#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19158#false} is VALID [2022-04-15 12:58:55,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {19158#false} ~cond := #in~cond; {19158#false} is VALID [2022-04-15 12:58:55,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {19158#false} assume 0 == ~cond; {19158#false} is VALID [2022-04-15 12:58:55,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {19158#false} assume !false; {19158#false} is VALID [2022-04-15 12:58:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:55,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:55,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {19158#false} assume !false; {19158#false} is VALID [2022-04-15 12:58:55,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {19158#false} assume 0 == ~cond; {19158#false} is VALID [2022-04-15 12:58:55,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {19158#false} ~cond := #in~cond; {19158#false} is VALID [2022-04-15 12:58:55,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {19158#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19158#false} is VALID [2022-04-15 12:58:55,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19158#false} is VALID [2022-04-15 12:58:55,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {19251#(< 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; {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {19251#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {19202#(< 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; {19251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:58:55,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {19206#(< 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; {19202#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:55,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {19210#(< 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; {19206#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:55,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {19214#(< 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; {19210#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:55,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {19218#(< 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; {19214#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:55,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {19222#(< 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; {19218#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {19226#(< 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; {19222#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:58:55,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {19222#(< 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; {19226#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {19218#(< 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; {19222#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 12:58:55,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {19214#(< 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; {19218#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 12:58:55,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {19210#(< 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; {19214#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 12:58:55,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {19206#(< 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; {19210#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 12:58:55,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {19202#(< 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; {19206#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 12:58:55,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {19157#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; {19202#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 12:58:55,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {19157#true} ~z~0 := ~y~0; {19157#true} is VALID [2022-04-15 12:58:55,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {19157#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {19157#true} [149] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {19157#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {19157#true} call #t~ret15 := main(); {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19157#true} {19157#true} #83#return; {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {19157#true} assume true; {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {19157#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); {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {19157#true} call ULTIMATE.init(); {19157#true} is VALID [2022-04-15 12:58:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:58:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591756731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-15 12:58:56,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:58:56,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890168605] [2022-04-15 12:58:56,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890168605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:56,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:56,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:58:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71263706] [2022-04-15 12:58:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:58:56,954 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 35 [2022-04-15 12:58:56,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:58:56,954 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-15 12:58:57,065 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-15 12:58:57,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:58:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:58:57,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:58:57,066 INFO L87 Difference]: Start difference. First operand 109 states and 137 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-15 12:59:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:06,474 INFO L93 Difference]: Finished difference Result 179 states and 231 transitions. [2022-04-15 12:59:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:59:06,474 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 35 [2022-04-15 12:59:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:06,474 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-15 12:59:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 12:59:06,475 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-15 12:59:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 12:59:06,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-15 12:59:07,143 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-15 12:59:07,145 INFO L225 Difference]: With dead ends: 179 [2022-04-15 12:59:07,145 INFO L226 Difference]: Without dead ends: 168 [2022-04-15 12:59:07,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:59:07,146 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 113 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:07,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 53 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:59:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-15 12:59:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-04-15 12:59:07,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:07,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:07,913 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:07,914 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:07,916 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-04-15 12:59:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2022-04-15 12:59:07,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:07,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:07,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 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 168 states. [2022-04-15 12:59:07,917 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 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 168 states. [2022-04-15 12:59:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:07,919 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-04-15 12:59:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2022-04-15 12:59:07,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:07,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:07,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:07,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2022-04-15 12:59:07,921 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 35 [2022-04-15 12:59:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:07,921 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2022-04-15 12:59:07,921 INFO L479 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-15 12:59:07,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 149 transitions. [2022-04-15 12:59:14,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2022-04-15 12:59:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:59:14,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:14,667 INFO L499 BasicCegarLoop]: 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-15 12:59:14,682 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-15 12:59:14,867 WARN L460 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-15 12:59:14,867 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 9 times [2022-04-15 12:59:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:14,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394045816] [2022-04-15 12:59:15,026 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash -862505938, now seen corresponding path program 1 times [2022-04-15 12:59:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976867598] [2022-04-15 12:59:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:15,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {20359#(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); {20341#true} is VALID [2022-04-15 12:59:15,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {20341#true} assume true; {20341#true} is VALID [2022-04-15 12:59:15,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20341#true} {20341#true} #83#return; {20341#true} is VALID [2022-04-15 12:59:15,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {20341#true} call ULTIMATE.init(); {20359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:15,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {20359#(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); {20341#true} is VALID [2022-04-15 12:59:15,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {20341#true} assume true; {20341#true} is VALID [2022-04-15 12:59:15,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20341#true} {20341#true} #83#return; {20341#true} is VALID [2022-04-15 12:59:15,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {20341#true} call #t~ret15 := main(); {20341#true} is VALID [2022-04-15 12:59:15,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {20341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20341#true} is VALID [2022-04-15 12:59:15,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {20341#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20341#true} is VALID [2022-04-15 12:59:15,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {20341#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20341#true} is VALID [2022-04-15 12:59:15,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {20341#true} ~z~0 := ~y~0; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:15,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:15,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {20347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:15,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20349#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:15,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {20349#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:15,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20351#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 12:59:15,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {20351#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 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; {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:15,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:15,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:15,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~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; {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:15,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20356#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {20356#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20356#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {20356#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 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; {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {20352#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 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; {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:15,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {20353#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:15,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {20354#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:15,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:15,685 INFO L272 TraceCheckUtils]: 29: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20357#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:59:15,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {20357#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20358#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:59:15,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {20358#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20342#false} is VALID [2022-04-15 12:59:15,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {20342#false} assume !false; {20342#false} is VALID [2022-04-15 12:59:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:15,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976867598] [2022-04-15 12:59:15,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976867598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:15,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585902033] [2022-04-15 12:59:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:15,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:15,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:15,687 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-15 12:59:15,688 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-15 12:59:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:15,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:59:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:16,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {20341#true} call ULTIMATE.init(); {20341#true} is VALID [2022-04-15 12:59:16,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {20341#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); {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {20341#true} assume true; {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20341#true} {20341#true} #83#return; {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {20341#true} call #t~ret15 := main(); {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {20341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {20341#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {20341#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20341#true} is VALID [2022-04-15 12:59:16,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {20341#true} ~z~0 := ~y~0; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:16,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {20347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:16,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20349#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:16,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {20349#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:16,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:16,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {20350#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 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; {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:16,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {20348#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 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; {20411#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:59:16,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {20411#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 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; {20415#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-15 12:59:16,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {20415#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {20415#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-15 12:59:16,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {20415#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) 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; {20422#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:59:16,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {20422#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20411#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:59:16,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {20411#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 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; {20429#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:59:16,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {20429#(and (<= (+ main_~y~0 1) main_~z~0) (<= 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; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 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; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 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; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 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; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 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; {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:16,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {20346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:16,544 INFO L272 TraceCheckUtils]: 29: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:59:16,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {20454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:59:16,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {20458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20342#false} is VALID [2022-04-15 12:59:16,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {20342#false} assume !false; {20342#false} is VALID [2022-04-15 12:59:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:59:16,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:18,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {20342#false} assume !false; {20342#false} is VALID [2022-04-15 12:59:18,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {20458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20342#false} is VALID [2022-04-15 12:59:18,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {20454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:59:18,770 INFO L272 TraceCheckUtils]: 29: Hoare triple {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:59:18,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {20477#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20355#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:18,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {20481#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {20477#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:59:18,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {20485#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~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; {20481#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:59:18,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {20489#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 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; {20485#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:59:18,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 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; {20489#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {20500#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {20504#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967292 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; {20500#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {20508#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 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; {20504#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:18,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {20512#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 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; {20508#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:18,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {20512#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20512#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:18,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {20519#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {20512#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:18,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {20485#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 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; {20519#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:59:18,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {20526#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20485#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:59:18,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {20530#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20526#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {20530#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20530#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {20537#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 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; {20530#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {20541#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20537#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:59:18,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {20545#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 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; {20541#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20545#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:59:18,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {20341#true} ~z~0 := ~y~0; {20493#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:18,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {20341#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {20341#true} [151] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {20341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {20341#true} call #t~ret15 := main(); {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20341#true} {20341#true} #83#return; {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {20341#true} assume true; {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {20341#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); {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {20341#true} call ULTIMATE.init(); {20341#true} is VALID [2022-04-15 12:59:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585902033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:18,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 20] total 37 [2022-04-15 12:59:20,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394045816] [2022-04-15 12:59:20,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394045816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:20,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:20,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:59:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329892180] [2022-04-15 12:59:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:20,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:20,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:20,704 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-15 12:59:20,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:59:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:59:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:59:20,706 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:41,209 INFO L93 Difference]: Finished difference Result 199 states and 253 transitions. [2022-04-15 12:59:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:59:41,209 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2022-04-15 12:59:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2022-04-15 12:59:41,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 84 transitions. [2022-04-15 12:59:41,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:41,755 INFO L225 Difference]: With dead ends: 199 [2022-04-15 12:59:41,755 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 12:59:41,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=435, Invalid=3855, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:59:41,756 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:41,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 101 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 12:59:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 12:59:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 121. [2022-04-15 12:59:42,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:42,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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-15 12:59:42,570 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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-15 12:59:42,570 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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-15 12:59:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:42,571 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2022-04-15 12:59:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2022-04-15 12:59:42,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:42,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:42,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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 139 states. [2022-04-15 12:59:42,572 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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 139 states. [2022-04-15 12:59:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:42,574 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2022-04-15 12:59:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2022-04-15 12:59:42,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:42,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:42,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:42,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 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-15 12:59:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2022-04-15 12:59:42,576 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 36 [2022-04-15 12:59:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:42,576 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2022-04-15 12:59:42,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-15 12:59:42,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 152 transitions. [2022-04-15 12:59:48,359 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-15 12:59:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2022-04-15 12:59:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:59:48,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:48,360 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:48,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:48,560 WARN L460 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-15 12:59:48,561 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1466061842, now seen corresponding path program 18 times [2022-04-15 12:59:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:48,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282320479] [2022-04-15 12:59:48,714 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -984836205, now seen corresponding path program 1 times [2022-04-15 12:59:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:48,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421770983] [2022-04-15 12:59:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:49,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {21568#(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); {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {21553#true} assume true; {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21553#true} {21553#true} #83#return; {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {21553#true} call ULTIMATE.init(); {21568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:49,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {21568#(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); {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {21553#true} assume true; {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21553#true} {21553#true} #83#return; {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {21553#true} call #t~ret15 := main(); {21553#true} is VALID [2022-04-15 12:59:49,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {21553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21553#true} is VALID [2022-04-15 12:59:49,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {21553#true} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_34 v_main_~x~0_Out_68) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~x~0_In_34 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_68)) (= |v_main_#t~post6_Out_64| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post5_Out_64| 0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21553#true} is VALID [2022-04-15 12:59:49,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {21553#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {21553#true} is VALID [2022-04-15 12:59:49,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {21553#true} ~z~0 := ~y~0; {21553#true} is VALID [2022-04-15 12:59:49,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {21553#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; {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:49,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {21559#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:59:49,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {21559#(<= main_~z~0 (+ (* (div main_~z~0 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; {21560#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:49,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {21560#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {21561#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:49,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {21561#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {21562#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:49,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {21562#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {21562#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:49,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {21562#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21563#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:59:49,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {21563#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) 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; {21564#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} is VALID [2022-04-15 12:59:49,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {21564#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) 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; {21565#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:59:49,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {21565#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21566#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 12:59:49,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {21566#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) 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; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) 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; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) 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; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) 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; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) 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; {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 12:59:49,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {21567#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {21554#false} is VALID [2022-04-15 12:59:49,140 INFO L272 TraceCheckUtils]: 28: Hoare triple {21554#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21554#false} is VALID [2022-04-15 12:59:49,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {21554#false} ~cond := #in~cond; {21554#false} is VALID [2022-04-15 12:59:49,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {21554#false} assume 0 == ~cond; {21554#false} is VALID [2022-04-15 12:59:49,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {21554#false} assume !false; {21554#false} is VALID [2022-04-15 12:59:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:59:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:49,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421770983] [2022-04-15 12:59:49,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421770983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:49,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43446843] [2022-04-15 12:59:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:49,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:49,142 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-15 12:59:49,143 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-15 12:59:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:49,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:59:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:50,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {21553#true} call ULTIMATE.init(); {21553#true} is VALID [2022-04-15 12:59:50,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {21553#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); {21553#true} is VALID [2022-04-15 12:59:50,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {21553#true} assume true; {21553#true} is VALID [2022-04-15 12:59:50,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21553#true} {21553#true} #83#return; {21553#true} is VALID [2022-04-15 12:59:50,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {21553#true} call #t~ret15 := main(); {21553#true} is VALID [2022-04-15 12:59:50,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {21553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21553#true} is VALID [2022-04-15 12:59:50,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {21553#true} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_34 v_main_~x~0_Out_68) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~x~0_In_34 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_68)) (= |v_main_#t~post6_Out_64| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post5_Out_64| 0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21553#true} is VALID [2022-04-15 12:59:50,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {21553#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {21553#true} is VALID [2022-04-15 12:59:50,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {21553#true} ~z~0 := ~y~0; {21596#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:59:50,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {21596#(= 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; {21600#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {21600#(and (= main_~y~0 (+ main_~z~0 1)) (< 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; {21604#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {21604#(and (= main_~y~0 (+ main_~z~0 2)) (< 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; {21608#(and (= main_~y~0 (+ main_~z~0 3)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {21608#(and (= main_~y~0 (+ main_~z~0 3)) (< 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; {21612#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {21612#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 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; {21616#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {21616#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {21616#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:59:50,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {21616#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (< 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; {21623#(and (= (+ main_~y~0 1) (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 12:59:50,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {21623#(and (= (+ main_~y~0 1) (+ main_~z~0 4)) (< 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; {21627#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-15 12:59:50,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {21627#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ 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; {21631#(and (= (+ main_~y~0 2) (+ main_~z~0 1)) (< 0 (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-15 12:59:50,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {21631#(and (= (+ main_~y~0 2) (+ main_~z~0 1)) (< 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; {21635#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:59:50,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {21635#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21639#(and (= (+ 5 main_~y~0) main_~z~0) (< 0 (mod (+ 5 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:59:50,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {21639#(and (= (+ 5 main_~y~0) main_~z~0) (< 0 (mod (+ 5 main_~y~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {21639#(and (= (+ 5 main_~y~0) main_~z~0) (< 0 (mod (+ 5 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:59:50,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {21639#(and (= (+ 5 main_~y~0) main_~z~0) (< 0 (mod (+ 5 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; {21646#(and (= main_~z~0 (+ main_~y~0 4)) (< 0 (mod (+ main_~y~0 4) 4294967296)))} is VALID [2022-04-15 12:59:50,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {21646#(and (= main_~z~0 (+ main_~y~0 4)) (< 0 (mod (+ main_~y~0 4) 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; {21650#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:59:50,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {21650#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21654#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:59:50,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {21654#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 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; {21658#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:59:50,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {21658#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:50,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {21662#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:50,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {21662#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21554#false} is VALID [2022-04-15 12:59:50,797 INFO L272 TraceCheckUtils]: 28: Hoare triple {21554#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21554#false} is VALID [2022-04-15 12:59:50,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {21554#false} ~cond := #in~cond; {21554#false} is VALID [2022-04-15 12:59:50,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {21554#false} assume 0 == ~cond; {21554#false} is VALID [2022-04-15 12:59:50,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {21554#false} assume !false; {21554#false} is VALID [2022-04-15 12:59:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:50,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:51,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {21554#false} assume !false; {21554#false} is VALID [2022-04-15 12:59:51,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {21554#false} assume 0 == ~cond; {21554#false} is VALID [2022-04-15 12:59:51,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {21554#false} ~cond := #in~cond; {21554#false} is VALID [2022-04-15 12:59:51,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {21554#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {21554#false} is VALID [2022-04-15 12:59:51,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {21662#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21554#false} is VALID [2022-04-15 12:59:51,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {21662#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {21662#(< 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {21662#(< 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {21662#(< 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {21662#(< 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {21662#(< 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; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {21662#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21662#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 12:59:51,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {21720#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {21724#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {21720#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:59:51,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {21728#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {21724#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {21732#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21728#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {21732#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !(~z~0 % 4294967296 > 0); {21732#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:59:51,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {21728#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {21732#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-15 12:59:51,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {21724#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {21728#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {21720#(<= main_~z~0 (+ (* (div (+ main_~z~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; {21724#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {21720#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 12:59:51,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {21553#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; {21558#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:51,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {21553#true} ~z~0 := ~y~0; {21553#true} is VALID [2022-04-15 12:59:51,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {21553#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {21553#true} [153] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_34 v_main_~x~0_Out_68) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~x~0_In_34 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_68)) (= |v_main_#t~post6_Out_64| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post5_Out_64| 0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {21553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {21553#true} call #t~ret15 := main(); {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21553#true} {21553#true} #83#return; {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {21553#true} assume true; {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {21553#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); {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {21553#true} call ULTIMATE.init(); {21553#true} is VALID [2022-04-15 12:59:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:59:51,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43446843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:51,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:51,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 8] total 33 [2022-04-15 12:59:54,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:54,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282320479] [2022-04-15 12:59:54,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282320479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:54,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:54,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:59:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425669232] [2022-04-15 12:59:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 36 [2022-04-15 12:59:54,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:54,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-15 12:59:54,558 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-15 12:59:54,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:59:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:59:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:59:54,559 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-15 13:00:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:21,665 INFO L93 Difference]: Finished difference Result 163 states and 209 transitions. [2022-04-15 13:00:21,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:00:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 36 [2022-04-15 13:00:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-15 13:00:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2022-04-15 13:00:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-15 13:00:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2022-04-15 13:00:21,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 90 transitions. [2022-04-15 13:00:22,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:22,542 INFO L225 Difference]: With dead ends: 163 [2022-04-15 13:00:22,542 INFO L226 Difference]: Without dead ends: 158 [2022-04-15 13:00:22,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=683, Invalid=4867, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 13:00:22,543 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:22,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 52 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 13:00:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-15 13:00:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 122. [2022-04-15 13:00:23,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:23,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:23,402 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:23,402 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:23,404 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2022-04-15 13:00:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2022-04-15 13:00:23,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:23,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 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-15 13:00:23,405 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 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-15 13:00:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:23,407 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2022-04-15 13:00:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2022-04-15 13:00:23,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:23,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:23,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:23,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-04-15 13:00:23,409 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 36 [2022-04-15 13:00:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:23,410 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-04-15 13:00:23,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-15 13:00:23,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 153 transitions. [2022-04-15 13:00:29,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-04-15 13:00:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:00:29,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:29,572 INFO L499 BasicCegarLoop]: 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-15 13:00:29,590 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-15 13:00:29,773 WARN L460 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-15 13:00:29,773 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash -424783871, now seen corresponding path program 10 times [2022-04-15 13:00:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:29,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201596620] [2022-04-15 13:00:29,937 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1894124693, now seen corresponding path program 1 times [2022-04-15 13:00:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:29,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648745201] [2022-04-15 13:00:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:30,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {22756#(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); {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {22746#true} assume true; {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22746#true} {22746#true} #83#return; {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {22746#true} call ULTIMATE.init(); {22756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:30,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {22756#(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); {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {22746#true} assume true; {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22746#true} {22746#true} #83#return; {22746#true} is VALID [2022-04-15 13:00:30,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {22746#true} call #t~ret15 := main(); {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {22746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#true} [155] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_35 v_main_~x~0_Out_70)) (and (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_70) (+ v_main_~x~0_In_35 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {22746#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {22746#true} ~z~0 := ~y~0; {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {22746#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; {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {22746#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; {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {22746#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; {22746#true} is VALID [2022-04-15 13:00:30,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {22746#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; {22746#true} is VALID [2022-04-15 13:00:30,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {22746#true} assume !(~z~0 % 4294967296 > 0); {22751#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:30,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {22751#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:30,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:00:30,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:30,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:30,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:30,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:00:30,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:30,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {22751#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:30,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {22751#(<= 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; {22747#false} is VALID [2022-04-15 13:00:30,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {22747#false} assume !(~z~0 % 4294967296 > 0); {22747#false} is VALID [2022-04-15 13:00:30,368 INFO L272 TraceCheckUtils]: 30: Hoare triple {22747#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22747#false} is VALID [2022-04-15 13:00:30,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {22747#false} ~cond := #in~cond; {22747#false} is VALID [2022-04-15 13:00:30,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {22747#false} assume 0 == ~cond; {22747#false} is VALID [2022-04-15 13:00:30,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {22747#false} assume !false; {22747#false} is VALID [2022-04-15 13:00:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 13:00:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648745201] [2022-04-15 13:00:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648745201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081721665] [2022-04-15 13:00:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:30,370 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-15 13:00:30,372 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-15 13:00:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:30,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 13:00:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:30,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:31,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {22746#true} call ULTIMATE.init(); {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {22746#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); {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {22746#true} assume true; {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22746#true} {22746#true} #83#return; {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {22746#true} call #t~ret15 := main(); {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {22746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#true} [155] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_35 v_main_~x~0_Out_70)) (and (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_70) (+ v_main_~x~0_In_35 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22746#true} is VALID [2022-04-15 13:00:31,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {22746#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22746#true} is VALID [2022-04-15 13:00:31,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {22746#true} ~z~0 := ~y~0; {22784#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:00:31,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {22784#(= 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; {22788#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 13:00:31,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {22788#(= 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; {22792#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 13:00:31,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {22792#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22796#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 13:00:31,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {22796#(= (+ (- 2) 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; {22800#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 13:00:31,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {22800#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {22800#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 13:00:31,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {22800#(= (+ (- 2) main_~y~0) (+ main_~z~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; {22792#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 13:00:31,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {22792#(= main_~y~0 (+ main_~z~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; {22784#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:00:31,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {22784#(= main_~z~0 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; {22813#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 13:00:31,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {22813#(= (+ (- 1) 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; {22817#(= (+ main_~y~0 2) (+ (- 2) main_~z~0))} is VALID [2022-04-15 13:00:31,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {22817#(= (+ main_~y~0 2) (+ (- 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:31,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:31,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:00:31,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:31,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {22751#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:31,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {22751#(<= 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; {22747#false} is VALID [2022-04-15 13:00:31,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {22747#false} assume !(~z~0 % 4294967296 > 0); {22747#false} is VALID [2022-04-15 13:00:31,175 INFO L272 TraceCheckUtils]: 30: Hoare triple {22747#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22747#false} is VALID [2022-04-15 13:00:31,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {22747#false} ~cond := #in~cond; {22747#false} is VALID [2022-04-15 13:00:31,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {22747#false} assume 0 == ~cond; {22747#false} is VALID [2022-04-15 13:00:31,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {22747#false} assume !false; {22747#false} is VALID [2022-04-15 13:00:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:00:31,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:32,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {22747#false} assume !false; {22747#false} is VALID [2022-04-15 13:00:32,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {22747#false} assume 0 == ~cond; {22747#false} is VALID [2022-04-15 13:00:32,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {22747#false} ~cond := #in~cond; {22747#false} is VALID [2022-04-15 13:00:32,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {22747#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22747#false} is VALID [2022-04-15 13:00:32,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {22747#false} assume !(~z~0 % 4294967296 > 0); {22747#false} is VALID [2022-04-15 13:00:32,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {22751#(<= 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; {22747#false} is VALID [2022-04-15 13:00:32,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {22751#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:32,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {22752#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:32,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 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; {22753#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 13:00:32,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22754#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:32,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {22911#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22755#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 13:00:32,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {22915#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {22911#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:00:32,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {22919#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {22915#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:32,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {22923#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~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; {22919#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:00:32,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {22927#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22923#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:32,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {22927#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22927#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:32,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {22934#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 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; {22927#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:32,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {22938#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ 4294967292 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; {22934#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 13:00:32,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {22942#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {22938#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 13:00:32,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {22946#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4)) (< 0 (mod (+ 4294967292 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; {22942#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:32,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {22746#true} ~z~0 := ~y~0; {22946#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 13:00:32,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {22746#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#true} [155] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (= v_main_~x~0_In_35 v_main_~x~0_Out_70)) (and (< 0 (mod (+ v_main_~x~0_Out_70 1) 4294967296)) (<= v_main_~x~0_Out_70 v_main_~x~0_In_35) (= (+ v_main_~y~0_Out_66 v_main_~x~0_Out_70) (+ v_main_~x~0_In_35 v_main_~y~0_In_33)) (= |v_main_#t~post5_Out_66| 0) (= |v_main_#t~post6_Out_66| 0))) InVars {main_~x~0=v_main_~x~0_In_35, main_~y~0=v_main_~y~0_In_33} OutVars{main_~y~0=v_main_~y~0_Out_66, main_#t~post5=|v_main_#t~post5_Out_66|, main_~x~0=v_main_~x~0_Out_70, main_#t~post6=|v_main_#t~post6_Out_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {22746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {22746#true} call #t~ret15 := main(); {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22746#true} {22746#true} #83#return; {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {22746#true} assume true; {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {22746#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); {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {22746#true} call ULTIMATE.init(); {22746#true} is VALID [2022-04-15 13:00:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:00:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081721665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:32,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 16] total 24 [2022-04-15 13:00:34,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201596620] [2022-04-15 13:00:34,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201596620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:34,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:34,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:00:34,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982493679] [2022-04-15 13:00:34,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:34,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:34,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:34,945 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-15 13:00:34,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:00:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:34,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:00:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:00:34,946 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:48,053 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2022-04-15 13:00:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:00:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:00:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 13:00:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 13:00:48,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-15 13:00:48,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:48,561 INFO L225 Difference]: With dead ends: 146 [2022-04-15 13:00:48,561 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 13:00:48,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 13:00:48,562 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:00:48,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 53 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 13:00:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 13:00:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-04-15 13:00:49,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:00:49,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,365 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,365 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:49,366 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2022-04-15 13:00:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2022-04-15 13:00:49,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:49,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:49,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 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 119 states. [2022-04-15 13:00:49,367 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 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 119 states. [2022-04-15 13:00:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:00:49,368 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2022-04-15 13:00:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2022-04-15 13:00:49,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:00:49,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:00:49,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:00:49,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:00:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2022-04-15 13:00:49,371 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2022-04-15 13:00:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:00:49,371 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2022-04-15 13:00:49,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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-15 13:00:49,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 139 transitions. [2022-04-15 13:00:55,323 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-15 13:00:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2022-04-15 13:00:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:00:55,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:55,324 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:55,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 13:00:55,524 WARN L460 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-15 13:00:55,524 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 636983262, now seen corresponding path program 19 times [2022-04-15 13:00:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:55,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778032367] [2022-04-15 13:00:55,679 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1644123133, now seen corresponding path program 1 times [2022-04-15 13:00:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:55,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326595445] [2022-04-15 13:00:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:56,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {23791#(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); {23770#true} is VALID [2022-04-15 13:00:56,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23770#true} {23770#true} #83#return; {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {23770#true} call ULTIMATE.init(); {23791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:56,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {23791#(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); {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23770#true} {23770#true} #83#return; {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {23770#true} call #t~ret15 := main(); {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {23770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {23770#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_36 v_main_~x~0_Out_72)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_68| 0) (= (+ v_main_~x~0_In_36 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_72)) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23770#true} is VALID [2022-04-15 13:00:56,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {23770#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23770#true} is VALID [2022-04-15 13:00:56,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {23770#true} ~z~0 := ~y~0; {23775#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:00:56,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {23775#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23776#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:56,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {23776#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23777#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:56,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {23777#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23778#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:56,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {23778#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23779#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:56,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {23779#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {23780#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:56,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {23780#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {23781#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:00:56,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {23781#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#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#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:56,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {23782#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 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; {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:56,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:56,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:56,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:56,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:56,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:56,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:56,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:56,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {23771#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; {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {23771#false} assume !(~x~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {23771#false} assume !(~z~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L272 TraceCheckUtils]: 29: Hoare triple {23771#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {23771#false} ~cond := #in~cond; {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {23771#false} assume 0 == ~cond; {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-04-15 13:00:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:00:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326595445] [2022-04-15 13:00:56,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326595445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469455588] [2022-04-15 13:00:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:56,735 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-15 13:00:56,736 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-15 13:00:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:56,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 13:00:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:56,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:57,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {23770#true} call ULTIMATE.init(); {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#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); {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23770#true} {23770#true} #83#return; {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {23770#true} call #t~ret15 := main(); {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {23770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {23770#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_36 v_main_~x~0_Out_72)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_68| 0) (= (+ v_main_~x~0_In_36 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_72)) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23770#true} is VALID [2022-04-15 13:00:57,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {23770#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23770#true} is VALID [2022-04-15 13:00:57,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {23770#true} ~z~0 := ~y~0; {23775#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:00:57,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {23775#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23776#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:00:57,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {23776#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23777#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:00:57,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {23777#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23778#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:00:57,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {23778#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23779#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:00:57,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {23779#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {23780#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:57,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {23780#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {23781#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:00:57,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {23781#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#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#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:00:57,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {23782#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 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; {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:57,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:57,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:57,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:57,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:57,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:57,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:57,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:57,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {23771#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; {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {23771#false} assume !(~x~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {23771#false} assume !(~z~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L272 TraceCheckUtils]: 29: Hoare triple {23771#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {23771#false} ~cond := #in~cond; {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {23771#false} assume 0 == ~cond; {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-04-15 13:00:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:00:57,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:59,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-04-15 13:00:59,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {23771#false} assume 0 == ~cond; {23771#false} is VALID [2022-04-15 13:00:59,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {23771#false} ~cond := #in~cond; {23771#false} is VALID [2022-04-15 13:00:59,103 INFO L272 TraceCheckUtils]: 29: Hoare triple {23771#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {23771#false} is VALID [2022-04-15 13:00:59,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {23771#false} assume !(~z~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:59,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {23771#false} assume !(~x~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:59,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {23771#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; {23771#false} is VALID [2022-04-15 13:00:59,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {23771#false} is VALID [2022-04-15 13:00:59,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23790#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:00:59,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23789#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:00:59,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23788#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:00:59,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23787#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:00:59,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {23786#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:00:59,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23785#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:59,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {23784#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:00:59,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:59,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {23939#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23783#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:59,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {23943#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {23939#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 13:00:59,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {23947#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23943#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:59,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {23951#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 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; {23947#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 13:00:59,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {23955#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 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; {23951#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 13:00:59,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {23959#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 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; {23955#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:00:59,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {23963#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 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; {23959#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:00:59,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {23967#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23963#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 13:00:59,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {23770#true} ~z~0 := ~y~0; {23967#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 13:00:59,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {23770#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {23770#true} [157] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (= v_main_~x~0_In_36 v_main_~x~0_Out_72)) (and (= |v_main_#t~post6_Out_68| 0) (<= v_main_~x~0_Out_72 v_main_~x~0_In_36) (= |v_main_#t~post5_Out_68| 0) (= (+ v_main_~x~0_In_36 v_main_~y~0_In_34) (+ v_main_~y~0_Out_68 v_main_~x~0_Out_72)) (< 0 (mod (+ v_main_~x~0_Out_72 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_36, main_~y~0=v_main_~y~0_In_34} OutVars{main_~y~0=v_main_~y~0_Out_68, main_#t~post5=|v_main_#t~post5_Out_68|, main_~x~0=v_main_~x~0_Out_72, main_#t~post6=|v_main_#t~post6_Out_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {23770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {23770#true} call #t~ret15 := main(); {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23770#true} {23770#true} #83#return; {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#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); {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {23770#true} call ULTIMATE.init(); {23770#true} is VALID [2022-04-15 13:00:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:00:59,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469455588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:59,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:59,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 13:01:02,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778032367] [2022-04-15 13:01:02,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778032367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:02,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:02,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:01:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582707834] [2022-04-15 13:01:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:02,939 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-15 13:01:02,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:02,939 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-15 13:01:03,146 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-15 13:01:03,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:01:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:01:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:01:03,148 INFO L87 Difference]: Start difference. First operand 111 states and 139 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-15 13:02:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:56,364 INFO L93 Difference]: Finished difference Result 236 states and 312 transitions. [2022-04-15 13:02:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-15 13:02:56,364 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-15 13:02:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:56,374 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-15 13:02:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 209 transitions. [2022-04-15 13:02:56,378 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-15 13:02:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 209 transitions. [2022-04-15 13:02:56,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 209 transitions. [2022-04-15 13:03:03,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:03,710 INFO L225 Difference]: With dead ends: 236 [2022-04-15 13:03:03,710 INFO L226 Difference]: Without dead ends: 202 [2022-04-15 13:03:03,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3829 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=1891, Invalid=11915, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 13:03:03,712 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 264 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:03,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 109 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2022-04-15 13:03:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-15 13:03:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 126. [2022-04-15 13:03:04,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:04,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,659 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,659 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:04,662 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2022-04-15 13:03:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 262 transitions. [2022-04-15 13:03:04,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:04,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:04,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 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 202 states. [2022-04-15 13:03:04,663 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 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 202 states. [2022-04-15 13:03:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:04,666 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2022-04-15 13:03:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 262 transitions. [2022-04-15 13:03:04,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:04,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:04,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:04,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2022-04-15 13:03:04,669 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 37 [2022-04-15 13:03:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:04,670 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2022-04-15 13:03:04,670 INFO L479 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-15 13:03:04,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 158 transitions. [2022-04-15 13:03:12,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2022-04-15 13:03:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:03:12,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:12,906 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:12,925 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-15 13:03:13,107 WARN L460 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-15 13:03:13,107 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -792671357, now seen corresponding path program 20 times [2022-04-15 13:03:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854173902] [2022-04-15 13:03:13,260 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:03:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1777648516, now seen corresponding path program 1 times [2022-04-15 13:03:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:13,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070351812] [2022-04-15 13:03:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:14,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {25321#(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); {25306#true} is VALID [2022-04-15 13:03:14,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {25306#true} assume true; {25306#true} is VALID [2022-04-15 13:03:14,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25306#true} {25306#true} #83#return; {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {25306#true} call ULTIMATE.init(); {25321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:14,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {25321#(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); {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {25306#true} assume true; {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25306#true} {25306#true} #83#return; {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {25306#true} call #t~ret15 := main(); {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {25306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25306#true} is VALID [2022-04-15 13:03:14,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {25306#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_35)) (= |v_main_#t~post5_Out_70| 0) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25306#true} is VALID [2022-04-15 13:03:14,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {25306#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 13:03:14,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {25311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {25311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 13:03:14,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {25311#(<= 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; {25312#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 13:03:14,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {25312#(<= 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; {25313#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {25313#(<= 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; {25314#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {25314#(<= 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; {25315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {25315#(<= 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; {25316#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 13:03:14,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {25316#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {25317#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {25317#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {25318#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {25318#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:03:14,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {25319#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {25320#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 13:03:14,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {25320#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {25307#false} assume !(~z~0 % 4294967296 > 0); {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L272 TraceCheckUtils]: 30: Hoare triple {25307#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {25307#false} ~cond := #in~cond; {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {25307#false} assume 0 == ~cond; {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {25307#false} assume !false; {25307#false} is VALID [2022-04-15 13:03:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 13:03:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070351812] [2022-04-15 13:03:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070351812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:14,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406214715] [2022-04-15 13:03:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:14,354 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-15 13:03:14,355 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-15 13:03:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:14,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 13:03:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:14,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:16,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {25306#true} call ULTIMATE.init(); {25306#true} is VALID [2022-04-15 13:03:16,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {25306#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); {25306#true} is VALID [2022-04-15 13:03:16,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {25306#true} assume true; {25306#true} is VALID [2022-04-15 13:03:16,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25306#true} {25306#true} #83#return; {25306#true} is VALID [2022-04-15 13:03:16,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {25306#true} call #t~ret15 := main(); {25306#true} is VALID [2022-04-15 13:03:16,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {25306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25306#true} is VALID [2022-04-15 13:03:16,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {25306#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_35)) (= |v_main_#t~post5_Out_70| 0) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25306#true} is VALID [2022-04-15 13:03:16,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {25306#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25306#true} is VALID [2022-04-15 13:03:16,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {25306#true} ~z~0 := ~y~0; {25306#true} is VALID [2022-04-15 13:03:16,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {25306#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; {25352#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:16,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {25352#(< 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; {25356#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:16,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {25356#(< 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; {25360#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:16,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {25360#(< 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; {25364#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:16,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {25364#(< 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; {25368#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {25368#(< 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; {25372#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:16,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {25372#(< 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; {25376#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {25376#(< 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; {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:03:16,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:03:16,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {25380#(< 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; {25376#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {25376#(< 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; {25372#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:16,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {25372#(< 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; {25368#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {25368#(< 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; {25364#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:16,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {25364#(< 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; {25360#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:16,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {25360#(< 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; {25356#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:16,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {25356#(< 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; {25352#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:16,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {25352#(< 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; {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {25408#(< 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; {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25307#false} is VALID [2022-04-15 13:03:16,300 INFO L272 TraceCheckUtils]: 30: Hoare triple {25307#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {25307#false} is VALID [2022-04-15 13:03:16,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {25307#false} ~cond := #in~cond; {25307#false} is VALID [2022-04-15 13:03:16,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {25307#false} assume 0 == ~cond; {25307#false} is VALID [2022-04-15 13:03:16,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {25307#false} assume !false; {25307#false} is VALID [2022-04-15 13:03:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:03:16,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:16,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {25307#false} assume !false; {25307#false} is VALID [2022-04-15 13:03:16,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {25307#false} assume 0 == ~cond; {25307#false} is VALID [2022-04-15 13:03:16,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {25307#false} ~cond := #in~cond; {25307#false} is VALID [2022-04-15 13:03:16,493 INFO L272 TraceCheckUtils]: 30: Hoare triple {25307#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {25307#false} is VALID [2022-04-15 13:03:16,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25307#false} is VALID [2022-04-15 13:03:16,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {25408#(< 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; {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {25408#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {25352#(< 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; {25408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:03:16,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {25356#(< 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; {25352#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:16,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {25360#(< 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; {25356#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:16,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {25364#(< 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; {25360#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:16,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {25368#(< 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; {25364#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:16,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {25372#(< 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; {25368#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {25376#(< 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; {25372#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:16,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {25380#(< 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; {25376#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:03:16,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {25376#(< 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; {25380#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:03:16,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {25372#(< 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; {25376#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {25368#(< 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; {25372#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:03:16,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {25364#(< 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; {25368#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:03:16,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {25360#(< 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; {25364#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:03:16,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {25356#(< 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; {25360#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:03:16,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {25352#(< 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; {25356#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:03:16,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {25306#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; {25352#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:03:16,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {25306#true} ~z~0 := ~y~0; {25306#true} is VALID [2022-04-15 13:03:16,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {25306#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25306#true} is VALID [2022-04-15 13:03:16,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {25306#true} [159] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (= v_main_~x~0_In_37 v_main_~x~0_Out_74)) (and (= (+ v_main_~y~0_Out_70 v_main_~x~0_Out_74) (+ v_main_~x~0_In_37 v_main_~y~0_In_35)) (= |v_main_#t~post5_Out_70| 0) (<= v_main_~x~0_Out_74 v_main_~x~0_In_37) (= |v_main_#t~post6_Out_70| 0) (< 0 (mod (+ v_main_~x~0_Out_74 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_37, main_~y~0=v_main_~y~0_In_35} OutVars{main_~y~0=v_main_~y~0_Out_70, main_#t~post5=|v_main_#t~post5_Out_70|, main_~x~0=v_main_~x~0_Out_74, main_#t~post6=|v_main_#t~post6_Out_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25306#true} is VALID [2022-04-15 13:03:16,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {25306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25306#true} is VALID [2022-04-15 13:03:16,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {25306#true} call #t~ret15 := main(); {25306#true} is VALID [2022-04-15 13:03:16,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25306#true} {25306#true} #83#return; {25306#true} is VALID [2022-04-15 13:03:16,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {25306#true} assume true; {25306#true} is VALID [2022-04-15 13:03:16,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {25306#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); {25306#true} is VALID [2022-04-15 13:03:16,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {25306#true} call ULTIMATE.init(); {25306#true} is VALID [2022-04-15 13:03:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:03:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406214715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:16,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:16,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2022-04-15 13:03:20,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:20,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854173902] [2022-04-15 13:03:20,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854173902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:20,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:20,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:03:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043222358] [2022-04-15 13:03:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:20,985 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 38 [2022-04-15 13:03:20,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:20,985 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-15 13:03:21,346 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-15 13:03:21,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:03:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:03:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:03:21,347 INFO L87 Difference]: Start difference. First operand 126 states and 158 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-15 13:03:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:44,455 INFO L93 Difference]: Finished difference Result 218 states and 283 transitions. [2022-04-15 13:03:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:03:44,455 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 38 [2022-04-15 13:03:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:44,455 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-15 13:03:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 114 transitions. [2022-04-15 13:03:44,456 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-15 13:03:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 114 transitions. [2022-04-15 13:03:44,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 114 transitions. [2022-04-15 13:03:45,514 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-15 13:03:45,517 INFO L225 Difference]: With dead ends: 218 [2022-04-15 13:03:45,517 INFO L226 Difference]: Without dead ends: 206 [2022-04-15 13:03:45,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:03:45,517 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 126 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:45,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 53 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 13:03:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-15 13:03:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 138. [2022-04-15 13:03:46,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:46,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:46,638 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:46,638 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:46,641 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2022-04-15 13:03:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2022-04-15 13:03:46,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:46,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:46,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 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 206 states. [2022-04-15 13:03:46,641 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 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 206 states. [2022-04-15 13:03:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:46,645 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2022-04-15 13:03:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2022-04-15 13:03:46,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:46,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:46,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:46,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2022-04-15 13:03:46,648 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 38 [2022-04-15 13:03:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:46,648 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2022-04-15 13:03:46,648 INFO L479 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-15 13:03:46,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 173 transitions. [2022-04-15 13:03:59,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2022-04-15 13:03:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:03:59,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:59,405 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:59,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:59,619 WARN L460 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-15 13:03:59,619 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1500294481, now seen corresponding path program 21 times [2022-04-15 13:03:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:59,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875345936] [2022-04-15 13:03:59,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:03:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1746940558, now seen corresponding path program 1 times [2022-04-15 13:03:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:59,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161701285] [2022-04-15 13:03:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {26720#(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); {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {26703#true} assume true; {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26703#true} {26703#true} #83#return; {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {26703#true} call ULTIMATE.init(); {26720#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#(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); {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {26703#true} assume true; {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26703#true} {26703#true} #83#return; {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {26703#true} call #t~ret15 := main(); {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {26703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26703#true} is VALID [2022-04-15 13:04:00,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {26703#true} [161] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_76) (+ v_main_~x~0_In_38 v_main_~y~0_In_36)) (= |v_main_#t~post5_Out_72| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38)) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26703#true} is VALID [2022-04-15 13:04:00,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {26703#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26703#true} is VALID [2022-04-15 13:04:00,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {26703#true} ~z~0 := ~y~0; {26708#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:04:00,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {26708#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26709#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:04:00,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {26709#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26710#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:04:00,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {26710#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26711#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:04:00,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {26711#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26712#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:04:00,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {26712#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {26713#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:04:00,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {26713#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {26714#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:04:00,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {26714#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:00,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:00,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:00,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:04:00,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:04:00,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {26704#false} assume !(~y~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {26704#false} assume !(~x~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {26704#false} assume !(~z~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L272 TraceCheckUtils]: 31: Hoare triple {26704#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {26704#false} ~cond := #in~cond; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {26704#false} assume 0 == ~cond; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {26704#false} assume !false; {26704#false} is VALID [2022-04-15 13:04:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:04:00,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161701285] [2022-04-15 13:04:00,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161701285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822028124] [2022-04-15 13:04:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:00,715 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-15 13:04:00,716 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-15 13:04:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:00,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:04:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:00,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:01,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {26703#true} call ULTIMATE.init(); {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {26703#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); {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {26703#true} assume true; {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26703#true} {26703#true} #83#return; {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {26703#true} call #t~ret15 := main(); {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {26703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {26703#true} [161] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_76) (+ v_main_~x~0_In_38 v_main_~y~0_In_36)) (= |v_main_#t~post5_Out_72| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38)) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {26703#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26703#true} is VALID [2022-04-15 13:04:01,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {26703#true} ~z~0 := ~y~0; {26708#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:04:01,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {26708#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26709#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:04:01,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {26709#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26710#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:04:01,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {26710#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26711#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:04:01,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {26711#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26712#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:04:01,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {26712#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {26713#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:04:01,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {26713#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {26766#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 13:04:01,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {26766#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:01,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:01,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:01,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:04:01,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:04:01,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:01,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:01,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:01,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {26704#false} assume !(~y~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {26704#false} assume !(~x~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {26704#false} assume !(~z~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L272 TraceCheckUtils]: 31: Hoare triple {26704#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {26704#false} ~cond := #in~cond; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {26704#false} assume 0 == ~cond; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {26704#false} assume !false; {26704#false} is VALID [2022-04-15 13:04:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:04:01,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:03,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {26704#false} assume !false; {26704#false} is VALID [2022-04-15 13:04:03,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {26704#false} assume 0 == ~cond; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {26704#false} ~cond := #in~cond; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L272 TraceCheckUtils]: 31: Hoare triple {26704#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {26704#false} assume !(~z~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {26704#false} assume !(~x~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {26704#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; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {26704#false} assume !(~y~0 % 4294967296 > 0); {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:03,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {26704#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:03,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#false} is VALID [2022-04-15 13:04:03,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26719#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:04:03,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26718#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:04:03,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {26717#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:03,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {26716#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:03,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {26766#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26715#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:04:03,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {26887#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26766#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 13:04:03,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {26891#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26887#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {26895#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26891#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {26899#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26895#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {26903#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26899#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {26907#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26903#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {26703#true} ~z~0 := ~y~0; {26907#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 13:04:03,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {26703#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {26703#true} [161] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_72| 0) (< 0 (mod (+ v_main_~x~0_Out_76 1) 4294967296)) (= (+ v_main_~y~0_Out_72 v_main_~x~0_Out_76) (+ v_main_~x~0_In_38 v_main_~y~0_In_36)) (= |v_main_#t~post5_Out_72| 0) (<= v_main_~x~0_Out_76 v_main_~x~0_In_38)) (and (= v_main_~y~0_In_36 v_main_~y~0_Out_72) (= v_main_~x~0_In_38 v_main_~x~0_Out_76))) InVars {main_~x~0=v_main_~x~0_In_38, main_~y~0=v_main_~y~0_In_36} OutVars{main_~y~0=v_main_~y~0_Out_72, main_#t~post5=|v_main_#t~post5_Out_72|, main_~x~0=v_main_~x~0_Out_76, main_#t~post6=|v_main_#t~post6_Out_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {26703#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {26703#true} call #t~ret15 := main(); {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26703#true} {26703#true} #83#return; {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {26703#true} assume true; {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {26703#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); {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {26703#true} call ULTIMATE.init(); {26703#true} is VALID [2022-04-15 13:04:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:04:03,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822028124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:03,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:03,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2022-04-15 13:04:07,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:07,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875345936] [2022-04-15 13:04:07,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875345936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:07,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:07,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:04:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20184297] [2022-04-15 13:04:07,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 39 [2022-04-15 13:04:07,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:07,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-15 13:04:07,417 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-15 13:04:07,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:04:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:04:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:04:07,417 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-15 13:04:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:45,302 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2022-04-15 13:04:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:04:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 39 [2022-04-15 13:04:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-15 13:04:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-15 13:04:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-15 13:04:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-15 13:04:45,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 73 transitions. [2022-04-15 13:04:46,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:46,187 INFO L225 Difference]: With dead ends: 165 [2022-04-15 13:04:46,187 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 13:04:46,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 13:04:46,188 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:46,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 87 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-04-15 13:04:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 13:04:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2022-04-15 13:04:47,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:47,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:47,231 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:47,232 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:47,234 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-04-15 13:04:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2022-04-15 13:04:47,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:47,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:47,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 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 150 states. [2022-04-15 13:04:47,234 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 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 150 states. [2022-04-15 13:04:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:47,236 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-04-15 13:04:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2022-04-15 13:04:47,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:47,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:47,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:47,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 130 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 168 transitions. [2022-04-15 13:04:47,239 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 168 transitions. Word has length 39 [2022-04-15 13:04:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:47,239 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 168 transitions. [2022-04-15 13:04:47,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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-15 13:04:47,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 168 transitions. [2022-04-15 13:05:02,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 167 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2022-04-15 13:05:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:05:02,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:02,800 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:02,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:03,001 WARN L460 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-15 13:05:03,001 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:03,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -274625873, now seen corresponding path program 22 times [2022-04-15 13:05:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:03,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124847035] [2022-04-15 13:05:03,157 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -445627826, now seen corresponding path program 1 times [2022-04-15 13:05:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350476534] [2022-04-15 13:05:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:04,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {27911#(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); {27888#true} is VALID [2022-04-15 13:05:04,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {27888#true} assume true; {27888#true} is VALID [2022-04-15 13:05:04,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27888#true} {27888#true} #83#return; {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {27888#true} call ULTIMATE.init(); {27911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:04,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {27911#(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); {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {27888#true} assume true; {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27888#true} {27888#true} #83#return; {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {27888#true} call #t~ret15 := main(); {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {27888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {27888#true} [163] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_37)) (= |v_main_#t~post6_Out_74| 0) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27888#true} is VALID [2022-04-15 13:05:04,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {27888#true} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {27888#true} is VALID [2022-04-15 13:05:04,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {27888#true} ~z~0 := ~y~0; {27893#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:05:04,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {27893#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27894#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:05:04,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {27894#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27895#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:05:04,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {27895#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27896#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:05:04,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {27896#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27897#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:05:04,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {27897#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~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; {27898#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:05:04,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {27898#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {27899#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:05:04,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {27899#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27900#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:05:04,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {27900#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 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; {27901#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:05:04,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {27901#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) 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; {27902#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:05:04,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {27902#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {27902#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:05:04,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {27902#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27903#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:05:04,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {27903#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 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; {27904#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:05:04,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {27904#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27905#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:05:04,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {27905#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~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; {27906#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:05:04,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {27906#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27907#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:05:04,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {27907#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27908#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:05:04,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {27908#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27909#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:05:04,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {27909#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27910#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:05:04,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {27910#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {27889#false} is VALID [2022-04-15 13:05:04,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {27889#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; {27889#false} is VALID [2022-04-15 13:05:04,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {27889#false} assume !(~x~0 % 4294967296 > 0); {27889#false} is VALID [2022-04-15 13:05:04,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {27889#false} assume !(~z~0 % 4294967296 > 0); {27889#false} is VALID [2022-04-15 13:05:04,973 INFO L272 TraceCheckUtils]: 31: Hoare triple {27889#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {27889#false} is VALID [2022-04-15 13:05:04,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {27889#false} ~cond := #in~cond; {27889#false} is VALID [2022-04-15 13:05:04,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {27889#false} assume 0 == ~cond; {27889#false} is VALID [2022-04-15 13:05:04,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {27889#false} assume !false; {27889#false} is VALID [2022-04-15 13:05:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:05:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:04,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350476534] [2022-04-15 13:05:04,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350476534] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:04,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917670519] [2022-04-15 13:05:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:04,974 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-15 13:05:04,975 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-15 13:05:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:05,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 13:05:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:05,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:09,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {27888#true} call ULTIMATE.init(); {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {27888#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); {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {27888#true} assume true; {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27888#true} {27888#true} #83#return; {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {27888#true} call #t~ret15 := main(); {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {27888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {27888#true} [163] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_37)) (= |v_main_#t~post6_Out_74| 0) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {27888#true} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {27888#true} is VALID [2022-04-15 13:05:09,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {27888#true} ~z~0 := ~y~0; {27893#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 13:05:09,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {27893#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27894#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:05:09,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {27894#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27945#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:05:09,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {27945#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27949#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:05:09,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {27949#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27953#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:05:09,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {27953#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (+ main_~z~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; {27957#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 13:05:09,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {27957#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0) (< 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; {27961#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:05:09,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {27961#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27965#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)))} is VALID [2022-04-15 13:05:09,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {27965#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0) (< 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; {27969#(and (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:05:09,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {27969#(and (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) 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; {27973#(and (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:05:09,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {27973#(and (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {27973#(and (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:05:09,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {27973#(and (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~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; {27980#(and (<= main_~y~0 (+ 7 main_~z~0)) (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:05:09,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {27980#(and (<= main_~y~0 (+ 7 main_~z~0)) (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (+ 7 main_~z~0) 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; {27984#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:05:09,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {27984#(< 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; {27988#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:05:09,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {27988#(< 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; {27992#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:05:09,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {27992#(< 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; {27996#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:05:09,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {27996#(< 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; {28000#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:05:09,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {28000#(< 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; {28004#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:05:09,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {28004#(< 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; {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {28008#(< 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; {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27889#false} is VALID [2022-04-15 13:05:09,179 INFO L272 TraceCheckUtils]: 31: Hoare triple {27889#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {27889#false} is VALID [2022-04-15 13:05:09,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {27889#false} ~cond := #in~cond; {27889#false} is VALID [2022-04-15 13:05:09,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {27889#false} assume 0 == ~cond; {27889#false} is VALID [2022-04-15 13:05:09,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {27889#false} assume !false; {27889#false} is VALID [2022-04-15 13:05:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:05:09,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:09,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {27889#false} assume !false; {27889#false} is VALID [2022-04-15 13:05:09,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {27889#false} assume 0 == ~cond; {27889#false} is VALID [2022-04-15 13:05:09,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {27889#false} ~cond := #in~cond; {27889#false} is VALID [2022-04-15 13:05:09,892 INFO L272 TraceCheckUtils]: 31: Hoare triple {27889#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {27889#false} is VALID [2022-04-15 13:05:09,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27889#false} is VALID [2022-04-15 13:05:09,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {28008#(< 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; {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {28008#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {28004#(< 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; {28008#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 13:05:09,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {28000#(< 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; {28004#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:05:09,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {27996#(< 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; {28000#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:05:09,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {27992#(< 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; {27996#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:05:09,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {27988#(< 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; {27992#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:05:09,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {27984#(< 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; {27988#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:05:09,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {28075#(< 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; {27984#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:05:09,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {28079#(< 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; {28075#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:05:09,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {28079#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28079#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:05:09,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {28075#(< 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; {28079#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 13:05:09,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {27984#(< 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; {28075#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 13:05:09,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {27988#(< 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; {27984#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 13:05:09,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {27992#(< 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; {27988#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 13:05:09,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {27996#(< 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; {27992#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 13:05:09,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {28000#(< 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; {27996#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 13:05:09,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {28004#(< 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; {28000#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {27888#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; {28004#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {27888#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; {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {27888#true} ~z~0 := ~y~0; {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {27888#true} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {27888#true} [163] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_78 1) 4294967296)) (= (+ v_main_~y~0_Out_74 v_main_~x~0_Out_78) (+ v_main_~x~0_In_39 v_main_~y~0_In_37)) (= |v_main_#t~post6_Out_74| 0) (<= v_main_~x~0_Out_78 v_main_~x~0_In_39) (= |v_main_#t~post5_Out_74| 0)) (and (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (= v_main_~x~0_In_39 v_main_~x~0_Out_78))) InVars {main_~x~0=v_main_~x~0_In_39, main_~y~0=v_main_~y~0_In_37} OutVars{main_~y~0=v_main_~y~0_Out_74, main_#t~post5=|v_main_#t~post5_Out_74|, main_~x~0=v_main_~x~0_Out_78, main_#t~post6=|v_main_#t~post6_Out_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {27888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {27888#true} call #t~ret15 := main(); {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27888#true} {27888#true} #83#return; {27888#true} is VALID [2022-04-15 13:05:09,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {27888#true} assume true; {27888#true} is VALID [2022-04-15 13:05:09,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {27888#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); {27888#true} is VALID [2022-04-15 13:05:09,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {27888#true} call ULTIMATE.init(); {27888#true} is VALID [2022-04-15 13:05:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:05:09,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917670519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:09,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:09,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 11] total 39 [2022-04-15 13:05:15,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124847035] [2022-04-15 13:05:15,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124847035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:15,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:05:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193133697] [2022-04-15 13:05:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:15,588 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-15 13:05:15,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:15,588 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-15 13:05:15,871 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-15 13:05:15,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:05:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:15,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:05:15,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1771, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:05:15,872 INFO L87 Difference]: Start difference. First operand 135 states and 168 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)