/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/loop-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:17:41,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:17:41,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:17:41,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:17:41,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:17:41,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:17:41,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:17:41,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:17:41,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:17:41,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:17:41,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:17:41,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:17:41,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:17:41,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:17:41,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:17:41,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:17:41,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:17:41,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:17:41,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:17:41,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:17:41,805 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:17:41,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:17:41,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:17:41,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:17:41,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:17:41,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:17:41,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:17:41,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:17:41,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:17:41,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:17:41,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:17:41,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:17:41,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:17:41,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:17:41,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:17:41,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:17:41,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:17:41,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:17:41,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:17:41,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:17:41,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:17:41,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:17:41,838 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:17:41,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:17:41,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:17:41,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:17:41,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:17:41,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:41,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:17:41,849 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:17:41,850 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:17:41,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:17:41,850 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:17:41,850 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:17:42,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:17:42,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:17:42,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:17:42,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:17:42,145 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:17:42,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-15 12:17:42,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b101031b0/7bbd3650c3504eea86151fd52ce7f5ad/FLAGd867845ea [2022-04-15 12:17:42,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:17:42,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-15 12:17:42,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b101031b0/7bbd3650c3504eea86151fd52ce7f5ad/FLAGd867845ea [2022-04-15 12:17:43,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b101031b0/7bbd3650c3504eea86151fd52ce7f5ad [2022-04-15 12:17:43,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:17:43,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:17:43,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:43,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:17:43,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:17:43,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482e5dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43, skipping insertion in model container [2022-04-15 12:17:43,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:17:43,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:17:43,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-04-15 12:17:43,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:43,538 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:17:43,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-04-15 12:17:43,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:43,579 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:17:43,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43 WrapperNode [2022-04-15 12:17:43,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:43,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:17:43,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:17:43,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:17:43,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:17:43,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:17:43,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:17:43,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:17:43,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (1/1) ... [2022-04-15 12:17:43,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:43,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:43,700 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:17:43,720 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:17:43,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:17:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:17:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:17:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:17:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:17:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:17:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:17:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:17:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:17:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:17:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:17:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:17:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:17:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:17:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:17:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:17:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:17:43,845 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:17:43,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:17:44,021 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:17:44,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:17:44,026 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:17:44,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:44 BoogieIcfgContainer [2022-04-15 12:17:44,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:17:44,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:17:44,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:17:44,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:17:44,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:17:43" (1/3) ... [2022-04-15 12:17:44,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a83a3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:44, skipping insertion in model container [2022-04-15 12:17:44,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:43" (2/3) ... [2022-04-15 12:17:44,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a83a3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:44, skipping insertion in model container [2022-04-15 12:17:44,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:44" (3/3) ... [2022-04-15 12:17:44,067 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2022-04-15 12:17:44,070 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:17:44,071 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:17:44,143 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:17:44,153 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:17:44,153 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:17:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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:17:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:44,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:44,198 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:44,198 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 12:17:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:44,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157013842] [2022-04-15 12:17:44,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 12:17:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:44,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894494940] [2022-04-15 12:17:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:44,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:44,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:17:44,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:17:44,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:17:44,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:44,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:17:44,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:17:44,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:17:44,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 12:17:44,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2022-04-15 12:17:44,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:17:44,616 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-15 12:17:44,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 12:17:44,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:17:44,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:17:44,620 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:17:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894494940] [2022-04-15 12:17:44,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894494940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:44,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:44,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:44,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157013842] [2022-04-15 12:17:44,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157013842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:44,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:44,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377362930] [2022-04-15 12:17:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:17:44,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:44,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:44,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:44,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:17:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:44,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:17:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:17:44,731 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:44,829 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:17:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:17:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:17:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:17:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:17:44,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 12:17:44,933 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:17:44,956 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:17:44,957 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 12:17:44,959 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:17:44,962 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 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:17:44,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 12:17:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 12:17:45,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:45,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,015 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,016 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,018 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:17:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:17:45,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:17:45,019 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:17:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,021 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:17:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:17:45,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:45,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 12:17:45,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 12:17:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:45,024 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 12:17:45,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 12:17:45,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:17:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:45,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:45,060 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:45,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:17:45,061 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 12:17:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:45,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1152440704] [2022-04-15 12:17:45,062 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 12:17:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020498886] [2022-04-15 12:17:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:17:45,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:17:45,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:17:45,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:45,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:17:45,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:17:45,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:17:45,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-15 12:17:45,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0; {140#(= main_~x~0 0)} is VALID [2022-04-15 12:17:45,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {136#false} is VALID [2022-04-15 12:17:45,275 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-15 12:17:45,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 12:17:45,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 12:17:45,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 12:17:45,277 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:17:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:45,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020498886] [2022-04-15 12:17:45,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020498886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:45,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:45,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:45,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:45,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1152440704] [2022-04-15 12:17:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1152440704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:45,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:45,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624850962] [2022-04-15 12:17:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:45,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:17:45,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:45,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:45,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:17:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:17:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:17:45,314 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,384 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:17:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:17:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:17:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:17:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:17:45,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 12:17:45,431 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:17:45,433 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:17:45,433 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:17:45,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:17:45,435 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:45,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:17:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:17:45,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:45,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,444 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,444 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,460 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:17:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:17:45,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:17:45,461 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:17:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,462 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:17:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:17:45,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:45,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:17:45,464 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:17:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:45,464 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:17:45,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:17:45,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:17:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:17:45,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:45,476 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:45,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:17:45,477 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 12:17:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:45,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725536517] [2022-04-15 12:17:45,626 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 12:17:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710704915] [2022-04-15 12:17:45,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:45,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:45,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-15 12:17:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533173018] [2022-04-15 12:17:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:17:45,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:17:45,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:17:45,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:45,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:17:45,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:17:45,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:17:45,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:17:45,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-15 12:17:45,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:45,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 12:17:45,840 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 12:17:45,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:17:45,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:17:45,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:17:45,842 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:17:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:45,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533173018] [2022-04-15 12:17:45,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533173018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:45,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990731193] [2022-04-15 12:17:45,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:45,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:45,845 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:17:45,846 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:17:45,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:45,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:45,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:17:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:45,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 12:17:45,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:17:45,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:17:45,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:17:45,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:17:45,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-15 12:17:45,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {263#(= main_~x~0 2)} is VALID [2022-04-15 12:17:45,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~x~0 2)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 12:17:45,939 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 12:17:45,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:17:45,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:17:45,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:17:45,939 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:17:45,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:46,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:17:46,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:17:46,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:17:46,009 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 12:17:46,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 12:17:46,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {291#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:46,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:46,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:17:46,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:17:46,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:17:46,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:17:46,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 12:17:46,012 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:17:46,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990731193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:46,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:46,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:17:46,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:46,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725536517] [2022-04-15 12:17:46,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725536517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:46,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:46,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028385371] [2022-04-15 12:17:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:17:46,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:46,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:46,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:17:46,027 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,081 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:17:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:17:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:17:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:17:46,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 12:17:46,100 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:17:46,102 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:17:46,102 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:17:46,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:46,108 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:46,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:17:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:17:46,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:46,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,117 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,117 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,118 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:17:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:17:46,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:17:46,118 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:17:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,120 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:17:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:17:46,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:46,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:17:46,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 12:17:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:46,122 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:17:46,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:17:46,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:17:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:17:46,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:46,135 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:46,155 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:17:46,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:46,353 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-15 12:17:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148572088] [2022-04-15 12:17:46,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 12:17:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:46,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671717378] [2022-04-15 12:17:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:46,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:46,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-15 12:17:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259668835] [2022-04-15 12:17:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 12:17:46,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 12:17:46,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 12:17:46,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:46,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 12:17:46,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 12:17:46,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 12:17:46,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 12:17:46,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-15 12:17:46,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:46,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:46,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 12:17:46,673 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 12:17:46,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 12:17:46,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 12:17:46,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 12:17:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:46,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259668835] [2022-04-15 12:17:46,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259668835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:46,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852973114] [2022-04-15 12:17:46,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:46,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:46,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:46,680 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:17:46,739 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:17:46,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:46,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:46,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:17:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:47,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-15 12:17:47,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 12:17:47,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 12:17:47,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 12:17:47,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 12:17:47,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-15 12:17:47,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:47,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:47,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 12:17:47,048 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 12:17:47,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 12:17:47,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 12:17:47,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 12:17:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:47,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:47,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 12:17:47,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 12:17:47,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 12:17:47,146 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 12:17:47,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 12:17:47,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {475#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 12:17:47,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 12:17:47,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 12:17:47,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 12:17:47,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-15 12:17:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852973114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:47,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:47,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:17:47,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:47,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148572088] [2022-04-15 12:17:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148572088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:47,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:47,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:17:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243862982] [2022-04-15 12:17:47,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:17:47,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:47,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:47,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:17:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:17:47,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:47,179 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,309 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:17:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:17:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:17:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:17:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:17:47,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 12:17:47,343 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:17:47,345 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:17:47,345 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:17:47,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:17:47,346 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:47,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:17:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:17:47,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:47,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,353 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,353 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:17:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:17:47,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:47,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:47,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:17:47,356 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:17:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,360 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:17:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:17:47,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:47,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:47,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:47,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:17:47,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 12:17:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:47,362 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:17:47,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:17:47,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:17:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:17:47,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:47,383 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:47,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 12:17:47,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 12:17:47,598 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-15 12:17:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600140384] [2022-04-15 12:17:47,655 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 12:17:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913787540] [2022-04-15 12:17:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:47,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:47,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-15 12:17:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:47,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132229236] [2022-04-15 12:17:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 12:17:47,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 12:17:47,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 12:17:47,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:47,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 12:17:47,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 12:17:47,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 12:17:47,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 12:17:47,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-15 12:17:47,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:47,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:47,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:47,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-15 12:17:47,894 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-15 12:17:47,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-15 12:17:47,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-15 12:17:47,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 12:17:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:47,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132229236] [2022-04-15 12:17:47,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132229236] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127291306] [2022-04-15 12:17:47,895 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:47,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:47,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:47,900 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:17:47,943 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:17:48,066 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:17:48,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:48,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:17:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:48,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:48,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-15 12:17:48,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 12:17:48,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 12:17:48,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 12:17:48,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 12:17:48,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-15 12:17:48,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:48,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:48,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:48,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-15 12:17:48,475 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-15 12:17:48,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-15 12:17:48,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-15 12:17:48,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 12:17:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:48,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:48,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 12:17:48,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-15 12:17:48,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {666#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:17:48,694 INFO L272 TraceCheckUtils]: 10: Hoare triple {674#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {670#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:48,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {674#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 12:17:48,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 12:17:48,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:48,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:17:48,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:17:48,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 12:17:48,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 12:17:48,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 12:17:48,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 12:17:48,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-15 12:17:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:48,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127291306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:48,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-15 12:17:48,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600140384] [2022-04-15 12:17:48,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600140384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:17:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866303582] [2022-04-15 12:17:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:48,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:48,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:48,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:17:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:17:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:17:48,733 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,929 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:17:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:17:48,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:17:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:17:48,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 12:17:48,961 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:17:48,964 INFO L225 Difference]: With dead ends: 21 [2022-04-15 12:17:48,964 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:17:48,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:17:48,965 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:48,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:17:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:17:48,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:48,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,972 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,973 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,974 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:17:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:17:48,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:48,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:48,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:17:48,975 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:17:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,992 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:17:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:17:48,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:48,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:48,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:48,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:17:48,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 12:17:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:48,995 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:17:48,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:48,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:17:49,008 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:17:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:17:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:17:49,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:49,008 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:49,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 12:17:49,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:49,224 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-15 12:17:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:49,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241532015] [2022-04-15 12:17:49,284 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 12:17:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:49,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36472966] [2022-04-15 12:17:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:49,300 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:49,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-15 12:17:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681490683] [2022-04-15 12:17:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 12:17:49,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 12:17:49,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 12:17:49,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:49,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 12:17:49,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 12:17:49,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 12:17:49,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 12:17:49,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:49,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 12:17:49,475 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 12:17:49,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 12:17:49,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 12:17:49,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 12:17:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681490683] [2022-04-15 12:17:49,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681490683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398225078] [2022-04-15 12:17:49,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:49,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:49,523 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:17:49,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:49,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:49,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:17:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:49,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-15 12:17:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 12:17:49,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 12:17:49,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 12:17:49,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 12:17:49,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:49,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 12:17:49,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 12:17:49,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 12:17:49,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 12:17:49,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 12:17:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:49,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:49,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 12:17:49,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 12:17:49,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 12:17:49,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 12:17:49,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 12:17:49,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {894#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:49,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:49,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:49,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:49,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:49,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 12:17:49,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 12:17:49,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 12:17:49,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 12:17:49,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-15 12:17:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:49,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398225078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:49,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:49,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:17:49,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:49,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241532015] [2022-04-15 12:17:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241532015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:49,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061057315] [2022-04-15 12:17:49,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:49,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:17:49,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:49,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:49,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:49,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:49,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:49,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:17:49,996 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:50,149 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:17:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:17:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:17:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:17:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:17:50,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:17:50,167 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:17:50,168 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:17:50,168 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:17:50,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:17:50,169 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:50,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:17:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:17:50,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:50,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,177 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,177 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:50,178 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:17:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:17:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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:17:50,178 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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:17:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:50,179 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:17:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:17:50,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:50,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:50,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:50,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:17:50,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 12:17:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:50,182 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:17:50,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:17:50,195 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:17:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:17:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:17:50,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:50,198 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:50,217 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:17:50,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:50,406 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-15 12:17:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:50,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258769961] [2022-04-15 12:17:50,449 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 12:17:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:50,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819136020] [2022-04-15 12:17:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:50,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:50,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-15 12:17:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242727421] [2022-04-15 12:17:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:50,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 12:17:50,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 12:17:50,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 12:17:50,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:50,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 12:17:50,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 12:17:50,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 12:17:50,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 12:17:50,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-15 12:17:50,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:50,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:50,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:50,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:50,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:50,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 12:17:50,582 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 12:17:50,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 12:17:50,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 12:17:50,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 12:17:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242727421] [2022-04-15 12:17:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242727421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447538663] [2022-04-15 12:17:50,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:50,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:50,602 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:17:50,603 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:17:50,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:50,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:50,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:17:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:50,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-15 12:17:50,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 12:17:50,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 12:17:50,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 12:17:50,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 12:17:50,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-15 12:17:50,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:50,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:50,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:50,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:50,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:50,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 12:17:50,917 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 12:17:50,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 12:17:50,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 12:17:50,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 12:17:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:50,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:51,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 12:17:51,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 12:17:51,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 12:17:51,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 12:17:51,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 12:17:51,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1126#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:51,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 12:17:51,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 12:17:51,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 12:17:51,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 12:17:51,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-15 12:17:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:51,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447538663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:51,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:51,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 12:17:51,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:51,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258769961] [2022-04-15 12:17:51,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258769961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:51,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:51,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:17:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954411961] [2022-04-15 12:17:51,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:17:51,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:51,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,087 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:17:51,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:17:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:17:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:17:51,088 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,323 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:17:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:17:51,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:17:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:17:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:17:51,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 12:17:51,351 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:17:51,352 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:17:51,352 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:17:51,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:17:51,353 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:51,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:17:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:17:51,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:51,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,365 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,365 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,366 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:17:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:17:51,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:51,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:51,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:51,367 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,368 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:17:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:17:51,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:51,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:51,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:51,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:17:51,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 12:17:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:51,370 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:17:51,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:51,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:17:51,502 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:17:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:17:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:17:51,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:51,502 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:51,523 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:17:51,703 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-15 12:17:51,703 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-15 12:17:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412305197] [2022-04-15 12:17:51,836 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 12:17:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:51,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072543031] [2022-04-15 12:17:51,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:51,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:51,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-15 12:17:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644056053] [2022-04-15 12:17:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 12:17:52,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:17:52,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 12:17:52,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:52,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 12:17:52,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:17:52,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 12:17:52,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 12:17:52,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-15 12:17:52,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:52,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:52,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:52,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:52,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:52,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:52,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-15 12:17:52,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-15 12:17:52,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-15 12:17:52,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 12:17:52,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:17:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644056053] [2022-04-15 12:17:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644056053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721678824] [2022-04-15 12:17:52,066 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:52,068 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:17:52,106 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:17:52,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:17:52,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:17:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:52,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 12:17:52,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 12:17:52,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:17:52,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 12:17:52,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 12:17:52,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-15 12:17:52,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:52,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:52,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:52,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:52,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:52,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:52,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-15 12:17:52,279 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-15 12:17:52,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-15 12:17:52,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 12:17:52,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:17:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:52,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:52,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 12:17:52,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 12:17:52,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1365#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:17:52,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {1373#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1369#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:52,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {1373#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 12:17:52,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:17:52,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 12:17:52,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 12:17:52,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 12:17:52,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 12:17:52,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 12:17:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:52,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721678824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:52,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:52,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-15 12:17:52,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:52,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412305197] [2022-04-15 12:17:52,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412305197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:52,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:52,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:17:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360715996] [2022-04-15 12:17:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:52,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,570 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:17:52,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:17:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:17:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:17:52,571 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,748 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:17:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:17:52,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:17:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:17:52,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 12:17:52,767 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:17:52,768 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:17:52,768 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:17:52,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:17:52,769 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:52,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:17:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:17:52,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:52,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,779 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,779 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,780 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:17:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:17:52,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:52,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:52,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:17:52,780 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:17:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,781 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:17:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:17:52,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:52,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:52,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:52,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 12:17:52,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 12:17:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:52,782 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 12:17:52,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:17:52,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 12:17:52,796 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:17:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:17:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:17:52,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:52,797 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:52,817 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:17:53,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:53,007 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-15 12:17:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:53,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1314955448] [2022-04-15 12:17:53,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-15 12:17:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065936269] [2022-04-15 12:17:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:53,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:53,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-15 12:17:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292370655] [2022-04-15 12:17:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 12:17:53,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 12:17:53,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 12:17:53,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:53,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 12:17:53,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 12:17:53,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 12:17:53,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 12:17:53,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-15 12:17:53,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:53,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:53,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:53,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:53,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:53,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:53,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:53,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 12:17:53,224 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 12:17:53,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 12:17:53,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 12:17:53,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 12:17:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:53,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292370655] [2022-04-15 12:17:53,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292370655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:53,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889483982] [2022-04-15 12:17:53,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:53,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:53,252 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:17:53,303 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:17:53,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:53,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:53,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:17:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:53,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-15 12:17:53,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 12:17:53,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 12:17:53,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 12:17:53,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 12:17:53,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-15 12:17:53,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:53,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:53,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:53,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:53,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:53,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:53,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:53,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 12:17:53,564 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 12:17:53,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 12:17:53,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 12:17:53,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 12:17:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:53,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:53,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 12:17:53,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 12:17:53,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 12:17:53,760 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 12:17:53,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {1641#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 12:17:53,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1641#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 12:17:53,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 12:17:53,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 12:17:53,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 12:17:53,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-15 12:17:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:53,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889483982] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:53,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:53,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:17:53,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1314955448] [2022-04-15 12:17:53,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1314955448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:53,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:53,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:17:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610098274] [2022-04-15 12:17:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:17:53,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:53,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:53,781 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:17:53,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:17:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:17:53,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:17:53,782 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,043 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:17:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:17:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:17:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:17:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:17:54,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 12:17:54,064 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:17:54,064 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:17:54,064 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:17:54,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:17:54,065 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:54,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:17:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:17:54,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:54,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,077 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,077 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,078 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:17:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:17:54,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:54,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:54,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:17:54,078 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:17:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,079 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:17:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:17:54,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:54,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:54,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:54,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:17:54,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 12:17:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:54,080 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:17:54,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:17:54,096 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:17:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:17:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:17:54,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:54,096 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:54,116 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:17:54,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:54,303 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-15 12:17:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:54,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607587637] [2022-04-15 12:17:54,337 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-15 12:17:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:54,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156872834] [2022-04-15 12:17:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:54,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:54,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-15 12:17:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:54,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500244024] [2022-04-15 12:17:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:17:54,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:17:54,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 12:17:54,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:54,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:17:54,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:17:54,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 12:17:54,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 12:17:54,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-15 12:17:54,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:54,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:54,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:54,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:54,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:54,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:54,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:54,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:54,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 12:17:54,519 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 12:17:54,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 12:17:54,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:17:54,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:17:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500244024] [2022-04-15 12:17:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500244024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373206576] [2022-04-15 12:17:54,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:54,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:54,540 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:17:54,541 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:17:54,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:54,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:17:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:54,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 12:17:54,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:17:54,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:17:54,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 12:17:54,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 12:17:54,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-15 12:17:54,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:54,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:54,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:54,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:54,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:54,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:54,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:54,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:54,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 12:17:54,789 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 12:17:54,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 12:17:54,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:17:54,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:17:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:54,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:55,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:17:55,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:17:55,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 12:17:55,007 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 12:17:55,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1921#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 12:17:55,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1921#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:17:55,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 12:17:55,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 12:17:55,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:17:55,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:17:55,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 12:17:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:55,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373206576] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:55,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:55,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 12:17:55,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:55,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607587637] [2022-04-15 12:17:55,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607587637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:55,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:55,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:17:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027161269] [2022-04-15 12:17:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:17:55,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:55,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,061 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:17:55,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:17:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:55,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:17:55,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:17:55,062 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,440 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:17:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:17:55,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:17:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:17:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:17:55,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 12:17:55,465 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:17:55,465 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:17:55,465 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:17:55,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:17:55,466 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:55,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:17:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:17:55,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:55,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:17:55,504 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:17:55,504 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:17:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,505 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:17:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:17:55,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-15 12:17:55,505 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-15 12:17:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,505 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:17:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:17:55,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:55,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:17:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 12:17:55,506 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 12:17:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:55,506 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 12:17:55,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 12:17:55,536 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:17:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:17:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:17:55,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:55,537 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:55,558 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:17:55,737 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,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2022-04-15 12:17:55,738 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-15 12:17:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:55,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18346865] [2022-04-15 12:17:55,806 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-15 12:17:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:55,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934857865] [2022-04-15 12:17:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:55,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:55,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:55,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-15 12:17:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:55,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811536376] [2022-04-15 12:17:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 12:17:56,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 12:17:56,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 12:17:56,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:56,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 12:17:56,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 12:17:56,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 12:17:56,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 12:17:56,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:56,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:56,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 12:17:56,027 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 12:17:56,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 12:17:56,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 12:17:56,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 12:17:56,027 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:17:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811536376] [2022-04-15 12:17:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811536376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933532618] [2022-04-15 12:17:56,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:56,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:56,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:56,028 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:17:56,029 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:17:56,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:17:56,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:56,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:17:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:56,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-15 12:17:56,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 12:17:56,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 12:17:56,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 12:17:56,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 12:17:56,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:56,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:56,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 12:17:56,313 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 12:17:56,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 12:17:56,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 12:17:56,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 12:17:56,313 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:17:56,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:56,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 12:17:56,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 12:17:56,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 12:17:56,568 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 12:17:56,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 12:17:56,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2217#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:17:56,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 12:17:56,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 12:17:56,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 12:17:56,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 12:17:56,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-15 12:17:56,584 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:17:56,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933532618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:56,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:56,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:17:56,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:56,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18346865] [2022-04-15 12:17:56,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18346865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:56,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:56,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:17:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637307448] [2022-04-15 12:17:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:56,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,598 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:17:56,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:17:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:56,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:17:56,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:17:56,599 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:56,958 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:17:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:17:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:17:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:17:56,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 12:17:56,978 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:17:56,979 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:17:56,979 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:17:56,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:17:56,980 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:56,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:17:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:17:56,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:56,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:56,993 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:56,994 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:56,995 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:17:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:17:56,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:56,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:56,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:17:56,995 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:17:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:56,995 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:17:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:17:56,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:56,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:56,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 12:17:56,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 12:17:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:56,996 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 12:17:56,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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:17:56,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 12:17:57,014 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:17:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:17:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:17:57,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:57,015 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:57,022 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:17:57,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:57,216 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-15 12:17:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336328109] [2022-04-15 12:17:57,244 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-15 12:17:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:57,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236981576] [2022-04-15 12:17:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:57,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:57,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-15 12:17:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:57,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697599800] [2022-04-15 12:17:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:57,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 12:17:57,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 12:17:57,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 12:17:57,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:57,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 12:17:57,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 12:17:57,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 12:17:57,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 12:17:57,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-15 12:17:57,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:57,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:57,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:57,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:57,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:57,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:57,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:57,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:57,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:57,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:57,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 12:17:57,409 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 12:17:57,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 12:17:57,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 12:17:57,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 12:17:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:57,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697599800] [2022-04-15 12:17:57,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697599800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:57,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686834360] [2022-04-15 12:17:57,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:57,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:57,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:57,410 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:17:57,419 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:17:57,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:57,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:57,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:17:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:57,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:57,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-15 12:17:57,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 12:17:57,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 12:17:57,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 12:17:57,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 12:17:57,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-15 12:17:57,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:57,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:57,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:57,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:57,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:57,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:57,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:57,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:57,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:57,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:17:57,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 12:17:57,658 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 12:17:57,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 12:17:57,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 12:17:57,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 12:17:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:57,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:57,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 12:17:57,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 12:17:57,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 12:17:57,983 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 12:17:57,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2529#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 12:17:57,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2529#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:17:57,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 12:17:57,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 12:17:57,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 12:17:57,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 12:17:57,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-15 12:17:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686834360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:57,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:57,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 12:17:57,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:57,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336328109] [2022-04-15 12:17:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336328109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:57,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:57,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:17:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634599633] [2022-04-15 12:17:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:57,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:57,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,018 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:17:58,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:17:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:17:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:17:58,019 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,338 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:17:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:17:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:17:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:17:58,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 12:17:58,354 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:17:58,355 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:17:58,355 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:17:58,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:17:58,356 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:58,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:17:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:17:58,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:58,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,367 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,367 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,368 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:17:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:17:58,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states 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:17:58,368 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states 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:17:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,368 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:17:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:17:58,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:58,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 12:17:58,369 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 12:17:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:58,369 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 12:17:58,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:58,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 12:17:58,385 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:17:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:17:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:17:58,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:58,385 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:58,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:58,586 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,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21 [2022-04-15 12:17:58,586 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-15 12:17:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444450678] [2022-04-15 12:17:58,615 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-15 12:17:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:58,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627159211] [2022-04-15 12:17:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:58,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:58,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-15 12:17:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:58,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849924246] [2022-04-15 12:17:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:58,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 12:17:58,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 12:17:58,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 12:17:58,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:58,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 12:17:58,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 12:17:58,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 12:17:58,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 12:17:58,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-15 12:17:58,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:58,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:58,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:58,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:58,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:58,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:58,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:58,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:58,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:58,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:17:58,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:17:58,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 12:17:58,855 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 12:17:58,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 12:17:58,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 12:17:58,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 12:17:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:58,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849924246] [2022-04-15 12:17:58,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849924246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:58,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009691449] [2022-04-15 12:17:58,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:58,872 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:17:58,872 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:17:58,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:58,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:58,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:17:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:58,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:59,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-15 12:17:59,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 12:17:59,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 12:17:59,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 12:17:59,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 12:17:59,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-15 12:17:59,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:59,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:59,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:59,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:59,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:59,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:59,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:59,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:59,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:59,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:17:59,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:17:59,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 12:17:59,151 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 12:17:59,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 12:17:59,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 12:17:59,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 12:17:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:59,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:59,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 12:17:59,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 12:17:59,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 12:17:59,531 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 12:17:59,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {2857#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 12:17:59,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2857#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:17:59,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 12:17:59,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 12:17:59,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 12:17:59,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 12:17:59,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-15 12:17:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:59,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009691449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:59,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:59,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 12:17:59,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444450678] [2022-04-15 12:17:59,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444450678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:59,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:59,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:17:59,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467816112] [2022-04-15 12:17:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:17:59,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:59,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:17:59,557 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:17:59,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:17:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:17:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:17:59,558 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:18:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:00,083 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:18:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:18:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:18:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:18:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:18:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:18:00,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 12:18:00,121 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:18:00,122 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:18:00,122 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:18:00,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:18:00,123 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:00,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:18:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:18:00,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:00,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:00,143 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:00,143 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:00,144 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:18:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:00,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:00,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:00,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:18:00,144 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:18:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:00,144 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:18:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:00,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:00,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:00,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:00,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:18:00,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 12:18:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:00,145 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:18:00,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:18:00,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:18:00,181 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:18:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:18:00,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:00,181 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:00,205 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:18:00,382 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,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23 [2022-04-15 12:18:00,382 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-15 12:18:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:00,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481014507] [2022-04-15 12:18:00,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-15 12:18:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448172702] [2022-04-15 12:18:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:00,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:00,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-15 12:18:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:00,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604192142] [2022-04-15 12:18:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:00,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 12:18:00,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 12:18:00,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:00,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:00,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:00,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:00,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:00,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:00,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-15 12:18:00,698 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-15 12:18:00,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-15 12:18:00,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 12:18:00,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 12:18:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:00,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604192142] [2022-04-15 12:18:00,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604192142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:00,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543555835] [2022-04-15 12:18:00,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:00,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:00,704 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:18:00,705 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:18:00,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:00,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:00,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:18:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:00,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-15 12:18:00,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 12:18:00,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 12:18:00,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 12:18:00,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 12:18:00,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:01,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:01,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:01,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:01,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:01,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:01,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-15 12:18:01,008 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-15 12:18:01,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-15 12:18:01,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 12:18:01,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 12:18:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:01,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:01,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 12:18:01,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {3192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 12:18:01,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:01,740 INFO L272 TraceCheckUtils]: 19: Hoare triple {3200#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:01,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3200#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:01,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:01,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:18:01,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 12:18:01,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 12:18:01,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 12:18:01,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 12:18:01,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-15 12:18:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:01,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543555835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:01,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:01,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 33 [2022-04-15 12:18:01,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:01,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481014507] [2022-04-15 12:18:01,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481014507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:01,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:01,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:18:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843674016] [2022-04-15 12:18:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:18:01,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:01,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:01,827 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:18:01,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:18:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:18:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:18:01,828 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:02,349 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:18:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:18:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:18:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:18:02,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 12:18:02,373 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:18:02,374 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:18:02,374 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:18:02,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=516, Invalid=1554, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:02,375 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:02,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:18:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:18:02,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:02,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,403 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,403 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:02,404 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:18:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:02,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:02,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:02,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states 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:18:02,404 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states 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:18:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:02,404 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:18:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:02,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:02,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:02,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:02,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 12:18:02,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 12:18:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:02,413 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 12:18:02,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:02,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 12:18:02,434 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:18:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:18:02,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:02,435 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:02,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:02,635 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,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2022-04-15 12:18:02,635 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-15 12:18:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684693820] [2022-04-15 12:18:02,693 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-15 12:18:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:02,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238867263] [2022-04-15 12:18:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:02,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:02,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:02,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-15 12:18:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:02,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854858222] [2022-04-15 12:18:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:02,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:02,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 12:18:02,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 12:18:03,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-15 12:18:03,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:03,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:03,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:03,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:03,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:03,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:03,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:03,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:03,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:03,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:03,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:03,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:03,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:18:03,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 12:18:03,009 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 12:18:03,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 12:18:03,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 12:18:03,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 12:18:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854858222] [2022-04-15 12:18:03,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854858222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453632574] [2022-04-15 12:18:03,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:03,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:03,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:03,044 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:18:03,103 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:18:03,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:03,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:03,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:18:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:03,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:03,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-15 12:18:03,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 12:18:03,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 12:18:03,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 12:18:03,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 12:18:03,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-15 12:18:03,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:03,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:03,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:03,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:03,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:03,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:03,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:03,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:03,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:03,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:03,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:03,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:03,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:03,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 12:18:03,420 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 12:18:03,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 12:18:03,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 12:18:03,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 12:18:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:03,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:03,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 12:18:03,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 12:18:03,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 12:18:03,909 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 12:18:03,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {3564#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 12:18:03,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3564#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:03,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 12:18:03,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 12:18:03,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 12:18:03,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 12:18:03,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-15 12:18:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:03,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453632574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:03,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:03,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:18:03,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:03,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684693820] [2022-04-15 12:18:03,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684693820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:03,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:03,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:18:03,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179268646] [2022-04-15 12:18:03,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:18:03,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:03,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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:18:03,930 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:18:03,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:18:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:18:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:18:03,931 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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:18:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,578 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:18:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:18:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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:18:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:18:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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:18:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:18:04,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 12:18:04,601 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:18:04,601 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:18:04,601 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:18:04,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:04,602 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:04,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:18:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:18:04,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:04,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,622 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,622 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,623 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:18:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:04,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:18:04,623 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:18:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,624 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:18:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:04,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:04,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:04,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:04,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 12:18:04,624 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 12:18:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:04,625 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 12:18:04,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 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:18:04,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 12:18:04,664 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:18:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:18:04,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:04,664 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:04,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:04,881 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,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-15 12:18:04,881 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-15 12:18:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42646650] [2022-04-15 12:18:04,906 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-15 12:18:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600509506] [2022-04-15 12:18:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:04,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:04,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-15 12:18:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248792684] [2022-04-15 12:18:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:05,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 12:18:05,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 12:18:05,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 12:18:05,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:05,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 12:18:05,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 12:18:05,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 12:18:05,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 12:18:05,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-15 12:18:05,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:05,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:05,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:05,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:05,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:05,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:05,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:05,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:05,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:05,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:05,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:05,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:05,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:05,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:05,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 12:18:05,107 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 12:18:05,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 12:18:05,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 12:18:05,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 12:18:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:05,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248792684] [2022-04-15 12:18:05,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248792684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:05,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873768239] [2022-04-15 12:18:05,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:05,108 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:18:05,109 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:18:05,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:05,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:05,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:18:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:05,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:05,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-15 12:18:05,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 12:18:05,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 12:18:05,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 12:18:05,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 12:18:05,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-15 12:18:05,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:05,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:05,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:05,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:05,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:05,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:05,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:05,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:05,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:05,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:05,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:05,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:05,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:05,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:05,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 12:18:05,439 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 12:18:05,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 12:18:05,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 12:18:05,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 12:18:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:05,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:06,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 12:18:06,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 12:18:06,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 12:18:06,027 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 12:18:06,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {3940#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 12:18:06,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3940#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:06,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 12:18:06,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 12:18:06,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 12:18:06,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 12:18:06,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-15 12:18:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:06,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873768239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:06,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:06,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 12:18:06,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:06,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42646650] [2022-04-15 12:18:06,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42646650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:06,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:06,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:18:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564798323] [2022-04-15 12:18:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:18:06,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:06,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:18:06,058 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:18:06,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:18:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:18:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:18:06,059 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:18:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,689 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:18:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:18:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:18:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:18:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:18:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:18:06,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 12:18:06,717 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:18:06,717 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:18:06,721 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:18:06,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:18:06,722 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:06,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:18:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:18:06,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:06,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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:18:06,742 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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:18:06,742 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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:18:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,742 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:18:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:06,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:06,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:06,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 27 states. [2022-04-15 12:18:06,743 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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 27 states. [2022-04-15 12:18:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,743 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:18:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:06,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:06,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:06,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:06,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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:18:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 12:18:06,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 12:18:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:06,744 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 12:18:06,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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:18:06,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 12:18:06,766 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:18:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:18:06,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:06,766 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:06,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 12:18:06,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:06,982 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-15 12:18:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879319282] [2022-04-15 12:18:07,065 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-15 12:18:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703253601] [2022-04-15 12:18:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-15 12:18:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222859775] [2022-04-15 12:18:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 12:18:07,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 12:18:07,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 12:18:07,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:07,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 12:18:07,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 12:18:07,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 12:18:07,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 12:18:07,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-15 12:18:07,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:07,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:07,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:07,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:07,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:07,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:07,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:07,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:07,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:07,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:07,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:07,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:07,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:07,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:07,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:07,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-15 12:18:07,336 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-15 12:18:07,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-15 12:18:07,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 12:18:07,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 12:18:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222859775] [2022-04-15 12:18:07,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222859775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237099793] [2022-04-15 12:18:07,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:07,337 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:18:07,338 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:18:07,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 12:18:07,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:07,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:18:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:07,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-15 12:18:07,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 12:18:07,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 12:18:07,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 12:18:07,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 12:18:07,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-15 12:18:07,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:07,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:07,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:07,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:07,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:07,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:07,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:07,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:07,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:07,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:07,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:07,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:07,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:07,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:07,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:07,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-15 12:18:07,621 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-15 12:18:07,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-15 12:18:07,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 12:18:07,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 12:18:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:07,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:08,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 12:18:08,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {4323#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 12:18:08,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {4327#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4323#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:08,457 INFO L272 TraceCheckUtils]: 22: Hoare triple {4331#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4327#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:08,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {4331#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 12:18:08,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:18:08,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 12:18:08,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 12:18:08,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-15 12:18:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237099793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:08,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:08,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-15 12:18:08,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879319282] [2022-04-15 12:18:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879319282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:08,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:18:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878846866] [2022-04-15 12:18:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:08,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:08,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:08,489 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:18:08,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:18:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:18:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:18:08,490 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,301 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:18:09,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:18:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:18:09,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 12:18:09,327 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:18:09,328 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:18:09,328 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:18:09,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:18:09,329 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:09,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:18:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:18:09,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:09,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,350 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,350 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,351 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:18:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:09,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:09,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:09,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:18:09,351 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:18:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,351 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:18:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:09,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:09,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:09,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:09,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 12:18:09,352 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 12:18:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:09,352 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 12:18:09,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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:18:09,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 12:18:09,372 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:18:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:18:09,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:09,373 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:09,389 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:18:09,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:09,574 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-15 12:18:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:09,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046411858] [2022-04-15 12:18:09,602 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-15 12:18:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:09,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965332484] [2022-04-15 12:18:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:09,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:09,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-15 12:18:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678380391] [2022-04-15 12:18:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 12:18:09,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 12:18:09,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 12:18:09,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:09,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 12:18:09,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 12:18:09,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 12:18:09,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 12:18:09,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-15 12:18:09,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:09,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:09,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:09,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:09,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:09,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:09,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:09,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:09,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:09,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:09,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:09,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:09,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:09,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:09,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:09,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:09,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 12:18:09,896 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 12:18:09,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 12:18:09,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 12:18:09,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 12:18:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:09,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678380391] [2022-04-15 12:18:09,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678380391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:09,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198917144] [2022-04-15 12:18:09,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:09,898 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:18:09,898 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:18:09,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:09,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:09,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:18:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:10,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-15 12:18:10,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 12:18:10,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 12:18:10,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 12:18:10,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 12:18:10,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-15 12:18:10,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:10,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:10,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:10,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:10,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:10,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:10,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:10,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:10,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:10,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:10,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:10,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:10,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:10,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:10,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:10,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:10,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 12:18:10,276 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 12:18:10,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 12:18:10,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 12:18:10,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 12:18:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:10,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 12:18:10,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 12:18:10,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 12:18:10,930 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 12:18:10,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {4743#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 12:18:10,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4743#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 12:18:10,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 12:18:10,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 12:18:10,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 12:18:10,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-15 12:18:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198917144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:10,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:10,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 12:18:10,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:10,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046411858] [2022-04-15 12:18:10,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046411858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:10,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:10,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:18:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790675848] [2022-04-15 12:18:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:10,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:10,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:10,972 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:18:10,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:18:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:18:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:18:10,974 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,611 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:18:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:18:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:18:11,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 12:18:11,645 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:18:11,645 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:18:11,645 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:18:11,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:18:11,646 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:11,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:18:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:18:11,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:11,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,668 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,668 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,668 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:11,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:11,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:11,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:18:11,669 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:18:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,669 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:11,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:11,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:11,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:11,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 12:18:11,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 12:18:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:11,670 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 12:18:11,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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:18:11,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 12:18:11,695 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:18:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:18:11,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:11,696 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:11,712 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:18:11,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33 [2022-04-15 12:18:11,896 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-15 12:18:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211099211] [2022-04-15 12:18:11,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-15 12:18:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:11,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612199374] [2022-04-15 12:18:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:11,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:11,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-15 12:18:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:11,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603219283] [2022-04-15 12:18:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:12,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 12:18:12,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 12:18:12,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 12:18:12,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:12,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 12:18:12,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 12:18:12,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 12:18:12,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 12:18:12,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-15 12:18:12,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:12,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:12,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:12,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:12,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:12,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:12,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:12,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:12,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:12,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:12,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:12,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:12,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:12,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:12,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:12,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:12,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:12,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 12:18:12,245 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 12:18:12,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 12:18:12,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 12:18:12,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 12:18:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603219283] [2022-04-15 12:18:12,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603219283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:12,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559088096] [2022-04-15 12:18:12,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:12,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:12,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:12,247 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:18:12,247 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:18:12,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:12,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:12,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:18:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:12,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:12,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-15 12:18:12,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 12:18:12,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 12:18:12,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 12:18:12,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 12:18:12,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-15 12:18:12,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:12,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:12,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:12,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:12,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:12,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:12,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:12,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:12,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:12,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:12,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:12,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:12,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:12,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:12,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:12,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:12,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:12,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 12:18:12,685 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 12:18:12,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 12:18:12,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 12:18:12,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 12:18:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:12,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:13,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 12:18:13,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 12:18:13,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 12:18:13,729 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 12:18:13,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {5167#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 12:18:13,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5167#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:13,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 12:18:13,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 12:18:13,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 12:18:13,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 12:18:13,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-15 12:18:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:13,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559088096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:13,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:13,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 12:18:13,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:13,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211099211] [2022-04-15 12:18:13,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211099211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:13,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:13,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:18:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162957603] [2022-04-15 12:18:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:18:13,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:13,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 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:18:13,772 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:18:13,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:18:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:18:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:18:13,773 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 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:18:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:14,788 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:18:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:18:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:18:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 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:18:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:18:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 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:18:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:18:14,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 12:18:14,831 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:18:14,832 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:18:14,832 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:18:14,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:18:14,833 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:14,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:18:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:18:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:18:14,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:14,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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:18:14,866 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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:18:14,866 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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:18:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:14,867 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:14,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:14,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:14,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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 30 states. [2022-04-15 12:18:14,868 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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 30 states. [2022-04-15 12:18:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:14,870 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:14,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:14,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:14,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:14,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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:18:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 12:18:14,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 12:18:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:14,877 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 12:18:14,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 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:18:14,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 12:18:14,906 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:18:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:18:14,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:14,907 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:14,929 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:18:15,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:15,107 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-15 12:18:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831963503] [2022-04-15 12:18:15,140 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-15 12:18:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411361180] [2022-04-15 12:18:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:15,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:15,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-15 12:18:15,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:15,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101900867] [2022-04-15 12:18:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 12:18:15,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 12:18:15,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 12:18:15,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:15,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 12:18:15,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 12:18:15,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 12:18:15,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 12:18:15,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-15 12:18:15,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:15,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:15,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:15,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:15,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:15,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:15,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:15,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:15,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:15,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:15,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:15,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:15,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:15,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:15,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:15,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:15,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:15,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:15,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-15 12:18:15,542 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-15 12:18:15,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-15 12:18:15,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 12:18:15,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 12:18:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101900867] [2022-04-15 12:18:15,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101900867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8995347] [2022-04-15 12:18:15,543 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:15,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:15,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:15,544 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:18:15,545 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:18:15,669 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:18:15,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:15,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:18:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:15,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-15 12:18:15,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 12:18:15,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 12:18:15,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 12:18:15,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 12:18:15,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-15 12:18:15,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:15,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:15,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:15,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:15,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:15,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:15,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:15,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:15,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:15,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:15,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:15,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:15,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:15,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:15,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:15,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:15,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:15,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:15,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-15 12:18:15,913 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-15 12:18:15,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-15 12:18:15,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 12:18:15,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 12:18:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:15,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:19,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {5598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:19,223 INFO L272 TraceCheckUtils]: 25: Hoare triple {5606#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:19,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5606#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-15 12:18:19,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-15 12:18:19,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-15 12:18:19,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:18:19,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:19,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 12:18:19,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 12:18:19,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 12:18:19,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 12:18:19,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 12:18:19,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-15 12:18:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8995347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:19,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-15 12:18:19,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831963503] [2022-04-15 12:18:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831963503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:19,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:18:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316594603] [2022-04-15 12:18:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:19,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:19,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:19,273 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:18:19,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:18:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:18:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:19,274 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,469 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:18:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:18:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:18:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:18:20,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 12:18:20,501 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:18:20,501 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:18:20,501 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:18:20,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:18:20,503 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:20,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:18:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:18:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:18:20,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:20,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,532 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,532 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,532 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:20,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:20,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:18:20,533 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:18:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,533 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:20,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:20,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:20,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:20,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 12:18:20,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 12:18:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:20,534 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 12:18:20,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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:18:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 12:18:20,578 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:18:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:18:20,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:20,579 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:20,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:20,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 12:18:20,780 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-15 12:18:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470481705] [2022-04-15 12:18:20,815 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-15 12:18:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:20,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241234497] [2022-04-15 12:18:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:20,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:20,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-15 12:18:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758131917] [2022-04-15 12:18:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:21,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 12:18:21,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 12:18:21,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 12:18:21,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:21,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 12:18:21,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 12:18:21,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 12:18:21,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 12:18:21,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-15 12:18:21,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:21,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:21,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:21,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:21,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:21,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:21,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:21,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:21,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:21,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:21,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:21,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:21,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:21,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:21,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:21,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:21,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:21,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:21,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:21,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 12:18:21,187 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 12:18:21,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 12:18:21,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 12:18:21,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 12:18:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758131917] [2022-04-15 12:18:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758131917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763933449] [2022-04-15 12:18:21,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:21,188 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:18:21,195 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:18:21,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:21,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:21,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 12:18:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:21,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:21,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-15 12:18:21,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 12:18:21,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 12:18:21,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 12:18:21,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 12:18:21,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-15 12:18:21,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:21,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:21,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:21,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:21,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:21,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:21,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:21,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:21,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:21,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:21,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:21,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:21,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:21,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:21,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:21,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:21,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:21,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:21,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:21,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 12:18:21,640 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 12:18:21,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 12:18:21,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 12:18:21,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 12:18:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:21,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:22,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 12:18:22,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 12:18:22,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 12:18:22,926 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 12:18:22,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {6066#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 12:18:22,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6066#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:18:22,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 12:18:22,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 12:18:22,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 12:18:22,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 12:18:22,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-15 12:18:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:22,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763933449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:22,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 12:18:22,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470481705] [2022-04-15 12:18:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470481705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:18:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130133196] [2022-04-15 12:18:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:18:22,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:22,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,974 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:18:22,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:18:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:18:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:18:22,975 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,457 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:18:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:18:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:18:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:18:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:18:24,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 12:18:24,481 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:18:24,482 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:18:24,482 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:18:24,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1043, Invalid=2989, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:18:24,483 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:24,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:18:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:18:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:18:24,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:24,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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:18:24,501 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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:18:24,501 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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:18:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,501 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:24,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-15 12:18:24,502 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-15 12:18:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,502 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:24,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:24,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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:18:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 12:18:24,503 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 12:18:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:24,503 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 12:18:24,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 12:18:24,545 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:18:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:18:24,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:24,546 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:24,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:18:24,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 12:18:24,756 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-15 12:18:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529812910] [2022-04-15 12:18:24,781 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-15 12:18:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:24,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336424061] [2022-04-15 12:18:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:24,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:24,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-15 12:18:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932184581] [2022-04-15 12:18:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 12:18:25,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 12:18:25,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 12:18:25,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:25,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 12:18:25,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 12:18:25,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 12:18:25,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 12:18:25,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-15 12:18:25,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:25,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:25,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:25,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:25,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:25,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:25,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:25,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:25,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:25,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:25,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:25,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:25,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:25,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:25,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:25,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:25,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:25,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:25,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:25,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-15 12:18:25,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 12:18:25,178 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 12:18:25,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 12:18:25,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 12:18:25,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 12:18:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:25,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:25,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932184581] [2022-04-15 12:18:25,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932184581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:25,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346943736] [2022-04-15 12:18:25,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:25,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:25,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:25,180 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:18:25,181 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:18:25,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:25,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:25,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:18:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:25,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-15 12:18:25,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 12:18:25,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 12:18:25,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 12:18:25,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 12:18:25,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-15 12:18:25,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:25,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:25,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:25,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:25,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:25,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:25,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:25,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:25,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:25,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:25,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:25,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:25,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:25,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:25,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:25,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:25,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:25,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:25,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:25,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:25,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 12:18:25,619 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 12:18:25,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 12:18:25,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 12:18:25,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 12:18:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:25,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:27,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 12:18:27,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 12:18:27,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 12:18:27,278 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 12:18:27,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {6538#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 12:18:27,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6538#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:27,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 12:18:27,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 12:18:27,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 12:18:27,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 12:18:27,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-15 12:18:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:27,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346943736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:27,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:27,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 12:18:27,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:27,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529812910] [2022-04-15 12:18:27,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529812910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:27,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:27,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:18:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341469598] [2022-04-15 12:18:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:27,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:27,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:27,336 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:18:27,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:18:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:18:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:27,337 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,997 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:18:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:18:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:18:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:18:28,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 12:18:29,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:29,035 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:18:29,035 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:18:29,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:18:29,036 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:29,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:18:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:18:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:18:29,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:29,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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:18:29,059 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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:18:29,059 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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:18:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:29,060 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:29,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:29,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:29,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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 33 states. [2022-04-15 12:18:29,060 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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 33 states. [2022-04-15 12:18:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:29,061 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:29,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:29,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:29,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:29,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 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:18:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 12:18:29,061 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 12:18:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:29,061 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 12:18:29,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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:18:29,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 12:18:29,118 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:18:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:18:29,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:29,119 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:29,136 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:18:29,334 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,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41 [2022-04-15 12:18:29,334 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-15 12:18:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214875663] [2022-04-15 12:18:29,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-15 12:18:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:29,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276329959] [2022-04-15 12:18:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:29,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:29,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-15 12:18:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:29,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548318102] [2022-04-15 12:18:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 12:18:29,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 12:18:29,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 12:18:29,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:29,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 12:18:29,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 12:18:29,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 12:18:29,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 12:18:29,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-15 12:18:29,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:29,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:29,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:29,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:29,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:29,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:29,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:29,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:29,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:29,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:29,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:29,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:29,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:29,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:29,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:29,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:29,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:29,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:29,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:29,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:29,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:29,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-15 12:18:29,784 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-15 12:18:29,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-15 12:18:29,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 12:18:29,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 12:18:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548318102] [2022-04-15 12:18:29,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548318102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029808520] [2022-04-15 12:18:29,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:29,787 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:18:29,793 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:18:29,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 12:18:29,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:29,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:18:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:30,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-15 12:18:30,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 12:18:30,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 12:18:30,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 12:18:30,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 12:18:30,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-15 12:18:30,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:30,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:30,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:30,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:30,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:30,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:30,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:30,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:30,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:30,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:30,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:30,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:30,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:30,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:30,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:30,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:30,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:30,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:30,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:30,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:30,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:30,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-15 12:18:30,258 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-15 12:18:30,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-15 12:18:30,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 12:18:30,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 12:18:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:30,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:32,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 12:18:32,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {7017#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 12:18:32,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7017#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:32,135 INFO L272 TraceCheckUtils]: 28: Hoare triple {7025#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:32,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {7025#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:32,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:18:32,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:32,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 12:18:32,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 12:18:32,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 12:18:32,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 12:18:32,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-15 12:18:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:32,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029808520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:32,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:32,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-15 12:18:32,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214875663] [2022-04-15 12:18:32,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214875663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:32,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:32,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:18:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546700776] [2022-04-15 12:18:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:32,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:32,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:32,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:32,212 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:18:32,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:18:32,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:18:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:18:32,213 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,766 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:18:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:18:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:18:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:18:33,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 12:18:33,797 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 12:18:33,807 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:18:33,807 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:18:33,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:18:33,819 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:33,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:18:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:18:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 12:18:33,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:33,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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:18:33,849 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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:18:33,849 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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:18:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,849 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:18:33,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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 34 states. [2022-04-15 12:18:33,850 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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 34 states. [2022-04-15 12:18:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,850 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:18:33,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:33,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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:18:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 12:18:33,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 12:18:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:33,853 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 12:18:33,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 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:18:33,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 12:18:33,890 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:18:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:18:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:18:33,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:33,891 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:33,897 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:18:34,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 12:18:34,097 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-15 12:18:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:34,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164937977] [2022-04-15 12:18:34,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:34,121 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-15 12:18:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:34,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341506234] [2022-04-15 12:18:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:34,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:34,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-15 12:18:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:34,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625411375] [2022-04-15 12:18:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:34,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 12:18:34,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:34,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 12:18:34,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-15 12:18:34,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:34,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:34,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:34,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:34,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:34,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:34,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:34,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:34,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:34,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:34,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:34,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:34,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:34,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:34,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:34,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:34,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:34,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:34,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:34,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:34,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:34,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:34,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 12:18:34,528 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 12:18:34,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 12:18:34,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 12:18:34,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 12:18:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625411375] [2022-04-15 12:18:34,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625411375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024103920] [2022-04-15 12:18:34,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:34,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:34,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:34,530 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:18:34,530 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:18:34,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:34,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:34,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:18:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:34,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:34,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-15 12:18:34,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 12:18:34,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 12:18:34,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 12:18:34,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 12:18:34,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-15 12:18:34,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:34,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:34,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:34,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:34,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:34,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:34,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:34,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:34,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:34,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:34,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:34,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:34,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:34,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:34,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:34,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:34,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:34,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:34,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:34,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:34,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:34,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:34,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 12:18:34,940 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 12:18:34,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 12:18:34,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 12:18:34,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 12:18:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:34,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:36,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 12:18:36,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 12:18:36,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 12:18:36,947 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 12:18:36,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {7533#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 12:18:36,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7533#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:36,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 12:18:36,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 12:18:36,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 12:18:36,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 12:18:36,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-15 12:18:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:36,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024103920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:36,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:36,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 12:18:36,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:36,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164937977] [2022-04-15 12:18:36,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164937977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:36,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:36,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:18:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943692224] [2022-04-15 12:18:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:18:36,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:36,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:37,004 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:18:37,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:18:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:18:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:18:37,005 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:39,299 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:18:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:18:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:18:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:18:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:18:39,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 12:18:39,339 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:18:39,340 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:18:39,340 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:18:39,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:18:39,341 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:39,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:18:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:18:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:18:39,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:39,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,372 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,372 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:39,373 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:18:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:18:39,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:39,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:39,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:18:39,373 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:18:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:39,373 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:18:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:18:39,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:39,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:39,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:39,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 12:18:39,374 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 12:18:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:39,374 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 12:18:39,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:39,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 12:18:39,430 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:18:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:18:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:18:39,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:39,431 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:39,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:39,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:39,631 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-15 12:18:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:39,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [732900717] [2022-04-15 12:18:39,667 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-15 12:18:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336758452] [2022-04-15 12:18:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:39,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:39,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-15 12:18:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:39,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126700004] [2022-04-15 12:18:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:40,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 12:18:40,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 12:18:40,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 12:18:40,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:40,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 12:18:40,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 12:18:40,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 12:18:40,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 12:18:40,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-15 12:18:40,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:40,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:40,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:40,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:40,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:40,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:40,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:40,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:40,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:40,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:40,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:40,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:40,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:40,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:40,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:40,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:40,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:40,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:40,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:40,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:40,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:40,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:40,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:40,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 12:18:40,183 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 12:18:40,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 12:18:40,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 12:18:40,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 12:18:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:40,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:40,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126700004] [2022-04-15 12:18:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126700004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:40,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849792599] [2022-04-15 12:18:40,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:40,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:40,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:40,185 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:18:40,186 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:18:40,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:40,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:40,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 12:18:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:40,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:40,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-15 12:18:40,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 12:18:40,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 12:18:40,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 12:18:40,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 12:18:40,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-15 12:18:40,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:40,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:40,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:40,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:40,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:40,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:40,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:40,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:40,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:40,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:40,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:40,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:40,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:40,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:40,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:40,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:40,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:40,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:40,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:40,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:40,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:40,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:40,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:40,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 12:18:40,662 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 12:18:40,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 12:18:40,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 12:18:40,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 12:18:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:40,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:43,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 12:18:43,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 12:18:43,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 12:18:43,132 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 12:18:43,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {8053#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 12:18:43,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8053#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:18:43,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 12:18:43,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 12:18:43,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 12:18:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 12:18:43,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-15 12:18:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:43,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849792599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:43,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:43,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 12:18:43,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:43,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [732900717] [2022-04-15 12:18:43,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [732900717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:43,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:43,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:18:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491345488] [2022-04-15 12:18:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:43,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:43,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:43,217 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:18:43,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:18:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:18:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:18:43,219 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:45,942 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:18:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:18:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:18:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:18:45,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 12:18:45,984 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:18:45,985 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:18:45,985 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:18:45,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 12:18:45,986 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:45,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:18:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:18:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 12:18:46,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:46,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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:18:46,018 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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:18:46,019 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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:18:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:46,019 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:18:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:18:46,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:46,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:46,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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 36 states. [2022-04-15 12:18:46,020 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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 36 states. [2022-04-15 12:18:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:46,020 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:18:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:18:46,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:46,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:46,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:46,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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:18:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 12:18:46,021 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 12:18:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:46,021 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 12:18:46,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 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:18:46,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 12:18:46,074 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:18:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:18:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:18:46,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:46,075 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:46,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:18:46,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:46,275 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-15 12:18:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282349978] [2022-04-15 12:18:46,307 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-15 12:18:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:46,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191175039] [2022-04-15 12:18:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:46,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:46,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-15 12:18:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:46,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661752491] [2022-04-15 12:18:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:46,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 12:18:46,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 12:18:46,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 12:18:46,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:46,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 12:18:46,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 12:18:46,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 12:18:46,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 12:18:46,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-15 12:18:46,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:46,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:46,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:46,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:46,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:46,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:46,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:46,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:46,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:46,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:46,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:46,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:46,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:46,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:46,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:46,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:46,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:46,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:46,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:46,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:46,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:46,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:46,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:46,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:46,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-15 12:18:46,790 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-15 12:18:46,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-15 12:18:46,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 12:18:46,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 12:18:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661752491] [2022-04-15 12:18:46,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661752491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331270801] [2022-04-15 12:18:46,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:46,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:46,796 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:18:46,796 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:18:47,105 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 12:18:47,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:47,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:18:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:47,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:47,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-15 12:18:47,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 12:18:47,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 12:18:47,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 12:18:47,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 12:18:47,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-15 12:18:47,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:47,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:47,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:47,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:47,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:47,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:47,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:47,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:47,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:47,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:47,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:47,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:47,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:47,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:47,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:47,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:47,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:47,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:47,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:47,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:47,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:47,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:47,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:47,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:18:47,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-15 12:18:47,443 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-15 12:18:47,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-15 12:18:47,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 12:18:47,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 12:18:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:47,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {8580#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8580#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:50,152 INFO L272 TraceCheckUtils]: 31: Hoare triple {8588#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:50,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8588#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:50,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:18:50,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:18:50,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 12:18:50,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 12:18:50,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 12:18:50,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 12:18:50,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-15 12:18:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331270801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:50,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-15 12:18:50,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:50,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282349978] [2022-04-15 12:18:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282349978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:18:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191196670] [2022-04-15 12:18:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:18:50,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:50,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:50,233 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:18:50,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:18:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:18:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:18:50,235 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,038 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:18:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:18:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:18:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:18:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:18:53,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 12:18:53,087 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:18:53,088 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:18:53,088 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:18:53,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:18:53,089 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:53,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:18:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:18:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:18:53,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:53,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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:18:53,126 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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:18:53,126 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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:18:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,127 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:18:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:18:53,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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 37 states. [2022-04-15 12:18:53,127 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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 37 states. [2022-04-15 12:18:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,127 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:18:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:18:53,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:53,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 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:18:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 12:18:53,128 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 12:18:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:53,128 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 12:18:53,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 12:18:53,183 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:18:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:18:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:18:53,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:53,183 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:53,197 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:18:53,384 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,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2022-04-15 12:18:53,384 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-15 12:18:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:53,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481085333] [2022-04-15 12:18:53,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-15 12:18:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406670147] [2022-04-15 12:18:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:53,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:53,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-15 12:18:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:53,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127609322] [2022-04-15 12:18:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 12:18:54,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 12:18:54,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 12:18:54,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:54,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 12:18:54,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 12:18:54,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 12:18:54,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 12:18:54,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-15 12:18:54,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:54,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:54,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:54,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:54,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:54,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:54,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:54,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:54,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:54,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:54,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:54,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:54,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:54,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:54,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:54,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:54,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:54,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:54,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:54,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:54,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:54,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:54,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:54,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:18:54,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:54,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 12:18:54,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 12:18:54,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 12:18:54,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 12:18:54,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 12:18:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127609322] [2022-04-15 12:18:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127609322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560215098] [2022-04-15 12:18:54,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:54,237 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:18:54,238 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:18:54,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:54,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:54,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 12:18:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:54,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-15 12:18:54,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 12:18:54,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 12:18:54,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 12:18:54,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 12:18:54,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-15 12:18:54,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:54,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:54,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:54,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:54,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:54,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:54,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:54,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:54,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:54,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:54,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:54,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:54,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:18:54,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:18:54,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:18:54,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:18:54,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:18:54,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:18:54,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:18:54,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:18:54,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:18:54,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:18:54,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:18:54,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:18:54,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:18:54,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 12:18:54,762 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 12:18:54,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 12:18:54,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 12:18:54,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 12:18:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:54,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:58,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 12:18:58,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 12:18:58,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 12:18:58,583 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 12:18:58,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {9144#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 12:18:58,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9144#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:18:58,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 12:18:58,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 12:18:58,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 12:18:58,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 12:18:58,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-15 12:18:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:58,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560215098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:58,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:58,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 12:18:58,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:58,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481085333] [2022-04-15 12:18:58,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481085333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:58,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:58,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:18:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210218253] [2022-04-15 12:18:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:18:58,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:58,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:18:58,696 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:18:58,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:18:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:18:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:18:58,697 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:19:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,275 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:19:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:19:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:19:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:19:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:19:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:19:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:19:02,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 12:19:02,307 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:19:02,308 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:19:02,308 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:19:02,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:19:02,309 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:02,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:19:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:19:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:19:02,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:02,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:02,334 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:02,345 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,346 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:19:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:02,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states 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:19:02,346 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states 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:19:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,347 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:19:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:02,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:02,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 12:19:02,347 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 12:19:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:02,348 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 12:19:02,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 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:19:02,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 12:19:02,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:19:02,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:02,414 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:02,432 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:19:02,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-15 12:19:02,627 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-15 12:19:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:02,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393350390] [2022-04-15 12:19:02,663 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-15 12:19:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644450431] [2022-04-15 12:19:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:02,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:02,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-15 12:19:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099651908] [2022-04-15 12:19:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:03,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 12:19:03,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 12:19:03,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 12:19:03,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:03,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 12:19:03,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 12:19:03,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 12:19:03,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 12:19:03,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-15 12:19:03,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:03,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:03,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:03,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:03,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:03,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:03,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:03,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:03,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:03,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:03,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:03,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:03,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:03,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:03,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:03,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:03,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:03,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:03,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:03,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:03,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:03,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:03,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:03,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:03,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:03,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:19:03,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 12:19:03,120 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 12:19:03,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 12:19:03,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 12:19:03,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 12:19:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099651908] [2022-04-15 12:19:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099651908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782369970] [2022-04-15 12:19:03,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:03,122 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:19:03,123 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:19:03,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:03,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:03,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:19:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:03,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:03,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-15 12:19:03,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 12:19:03,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 12:19:03,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 12:19:03,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 12:19:03,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-15 12:19:03,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:03,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:03,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:03,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:03,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:03,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:03,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:03,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:03,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:03,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:03,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:03,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:03,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:03,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:03,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:03,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:03,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:03,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:03,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:03,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:03,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:03,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:03,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:03,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:03,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:03,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:03,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 12:19:03,728 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 12:19:03,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 12:19:03,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 12:19:03,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 12:19:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:03,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:08,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 12:19:08,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 12:19:08,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 12:19:08,304 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 12:19:08,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {9712#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 12:19:08,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9712#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:19:08,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 12:19:08,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 12:19:08,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 12:19:08,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 12:19:08,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-15 12:19:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:08,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782369970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:08,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:08,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 12:19:08,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:08,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393350390] [2022-04-15 12:19:08,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393350390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:08,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:08,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:19:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728657195] [2022-04-15 12:19:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:08,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:08,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:08,434 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:19:08,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:19:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:19:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:19:08,435 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,379 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:19:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:19:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:19:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:19:13,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 12:19:13,420 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:19:13,421 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:19:13,421 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:19:13,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 12:19:13,435 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:13,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:19:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:19:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:19:13,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:13,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:13,476 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:13,476 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,476 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:19:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:13,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:13,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:19:13,477 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:19:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:13,477 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:19:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:13,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:13,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:13,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 12:19:13,478 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 12:19:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:13,478 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 12:19:13,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 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 12:19:13,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 12:19:13,533 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 12:19:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:19:13,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:13,534 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:13,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:13,750 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,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53 [2022-04-15 12:19:13,751 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-15 12:19:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020348959] [2022-04-15 12:19:13,786 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-15 12:19:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:13,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656488256] [2022-04-15 12:19:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:13,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:13,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-15 12:19:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:13,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197147910] [2022-04-15 12:19:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:14,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 12:19:14,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 12:19:14,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 12:19:14,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:14,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 12:19:14,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 12:19:14,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 12:19:14,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 12:19:14,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-15 12:19:14,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:14,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:14,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:14,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:14,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:14,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:14,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:14,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:14,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:14,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:14,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:14,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:14,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:14,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:14,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:14,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:14,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:14,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:14,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:14,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:14,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:14,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:14,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:14,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:14,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:14,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:14,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} is VALID [2022-04-15 12:19:14,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 12:19:14,311 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 12:19:14,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 12:19:14,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 12:19:14,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 12:19:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197147910] [2022-04-15 12:19:14,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197147910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126031009] [2022-04-15 12:19:14,312 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:14,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:14,313 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:19:14,314 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:19:14,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 12:19:14,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:14,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:19:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:14,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:15,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-15 12:19:15,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 12:19:15,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 12:19:15,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 12:19:15,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 12:19:15,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-15 12:19:15,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:15,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:15,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:15,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:15,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:15,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:15,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:15,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:15,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:15,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:15,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:15,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:15,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:15,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:15,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:15,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:15,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:15,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:15,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:15,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:15,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:15,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:15,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:15,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:15,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:15,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:15,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:19:15,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 12:19:15,351 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 12:19:15,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 12:19:15,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 12:19:15,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 12:19:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:15,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:22,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 12:19:22,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 12:19:22,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 12:19:22,603 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 12:19:22,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {10296#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 12:19:22,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10296#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:22,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-15 12:19:22,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-15 12:19:22,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-15 12:19:22,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:19:22,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 12:19:22,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} is VALID [2022-04-15 12:19:22,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} is VALID [2022-04-15 12:19:22,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:19:22,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 12:19:22,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 12:19:22,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 12:19:22,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 12:19:22,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 12:19:22,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-15 12:19:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:22,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126031009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:22,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:22,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 12:19:22,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020348959] [2022-04-15 12:19:22,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020348959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:22,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:22,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:19:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044722324] [2022-04-15 12:19:22,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:19:22,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:22,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:22,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:22,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:19:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:19:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:19:22,798 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:29,873 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:19:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:19:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:19:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:19:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:19:29,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 12:19:29,938 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:19:29,939 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:19:29,939 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:19:29,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:19:29,940 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:29,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 12:19:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:19:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 12:19:29,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:29,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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:19:29,981 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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:19:29,981 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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:19:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:29,981 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:19:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:19:29,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:29,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:29,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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 40 states. [2022-04-15 12:19:29,982 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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 40 states. [2022-04-15 12:19:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:29,982 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:19:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:19:29,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:29,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:29,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:29,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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:19:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 12:19:29,983 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 12:19:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:29,983 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 12:19:29,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 12:19:30,154 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:19:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:19:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:19:30,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:30,155 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:30,171 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:19:30,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:30,355 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-15 12:19:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:30,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478254217] [2022-04-15 12:19:30,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-15 12:19:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:30,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697243003] [2022-04-15 12:19:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:30,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:30,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-15 12:19:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196339122] [2022-04-15 12:19:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 12:19:31,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 12:19:31,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 12:19:31,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:31,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 12:19:31,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 12:19:31,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 12:19:31,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 12:19:31,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-15 12:19:31,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:31,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:31,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:31,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:31,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:31,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:31,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:31,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:31,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:31,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:31,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:31,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:31,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:31,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:31,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:31,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:31,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:31,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:31,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:31,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:31,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:31,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:31,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:31,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:31,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:31,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:31,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:19:31,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} is VALID [2022-04-15 12:19:31,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 12:19:31,118 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 12:19:31,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 12:19:31,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 12:19:31,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 12:19:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:31,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196339122] [2022-04-15 12:19:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196339122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:31,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144334453] [2022-04-15 12:19:31,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:31,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:31,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:31,120 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:19:31,122 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:19:31,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:31,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:31,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:19:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:31,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-15 12:19:31,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 12:19:31,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 12:19:31,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 12:19:31,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 12:19:31,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-15 12:19:31,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:31,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:31,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:31,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:31,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:31,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:31,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:31,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:31,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:31,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:31,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:31,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:31,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:31,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:31,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:31,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:31,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:31,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:31,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:31,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:31,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:31,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:31,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:31,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:31,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:31,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:31,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:19:31,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:19:31,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 12:19:31,688 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 12:19:31,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 12:19:31,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 12:19:31,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 12:19:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:31,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:38,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 12:19:38,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 12:19:38,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 12:19:38,237 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 12:19:38,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {10896#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 12:19:38,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10896#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:38,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 12:19:38,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 12:19:38,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 12:19:38,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 12:19:38,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-15 12:19:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144334453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:38,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 12:19:38,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478254217] [2022-04-15 12:19:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478254217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:19:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197400017] [2022-04-15 12:19:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:38,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:38,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:38,405 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 12:19:38,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:19:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:19:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:19:38,407 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:45,031 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:19:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:19:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:19:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:19:45,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 12:19:45,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:45,111 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:19:45,111 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:19:45,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:19:45,112 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:45,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 12:19:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:19:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:19:45,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:45,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:45,151 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:45,151 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:45,152 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:19:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:19:45,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:45,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:45,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:19:45,153 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:19:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:45,154 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:19:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:19:45,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:45,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:45,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:45,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 12:19:45,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 12:19:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:45,155 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 12:19:45,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 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 12:19:45,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 12:19:45,292 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:19:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:19:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:19:45,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:45,292 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:45,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:45,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:45,493 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-15 12:19:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183970050] [2022-04-15 12:19:45,529 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-15 12:19:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:45,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952231308] [2022-04-15 12:19:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:45,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:45,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-15 12:19:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:45,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635455052] [2022-04-15 12:19:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:46,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 12:19:46,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 12:19:46,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 12:19:46,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:46,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 12:19:46,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 12:19:46,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 12:19:46,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 12:19:46,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-15 12:19:46,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:46,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:46,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:46,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:46,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:46,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:46,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:46,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:46,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:46,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:46,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:46,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:46,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:46,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:46,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:46,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:46,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:46,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:46,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:46,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:46,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:46,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:46,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:46,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:46,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:46,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:46,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:19:46,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:19:46,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-15 12:19:46,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 12:19:46,443 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 12:19:46,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 12:19:46,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 12:19:46,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 12:19:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:46,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635455052] [2022-04-15 12:19:46,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635455052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:46,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136676940] [2022-04-15 12:19:46,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:46,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:46,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:46,445 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:19:46,487 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:19:46,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:46,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:46,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 12:19:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:46,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:46,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-15 12:19:46,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 12:19:46,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 12:19:46,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 12:19:46,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 12:19:46,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-15 12:19:46,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:46,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:46,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:46,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:46,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:47,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:47,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:47,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:47,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:47,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:47,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:47,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:47,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:47,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:47,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:47,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:19:47,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:19:47,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:19:47,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:19:47,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:19:47,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:19:47,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:19:47,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:19:47,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:19:47,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:19:47,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:19:47,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:19:47,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:19:47,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:19:47,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 12:19:47,096 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 12:19:47,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 12:19:47,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 12:19:47,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 12:19:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:47,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:57,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 12:19:57,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 12:19:57,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 12:19:57,182 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 12:19:57,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {11512#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 12:19:57,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11512#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:19:57,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 12:19:57,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 12:19:57,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 12:19:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 12:19:57,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-15 12:19:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136676940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:57,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:57,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 12:19:57,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183970050] [2022-04-15 12:19:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183970050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:57,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:57,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:19:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032267141] [2022-04-15 12:19:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:19:57,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:57,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:57,372 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:19:57,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:19:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:19:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:19:57,374 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:07,000 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:20:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:20:07,000 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:20:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:20:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:20:07,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 12:20:07,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:07,089 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:20:07,089 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:20:07,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 12:20:07,090 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:07,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:20:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:20:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 12:20:07,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:07,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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:20:07,129 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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:20:07,130 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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:20:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:07,130 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:20:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:20:07,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:07,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:07,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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 42 states. [2022-04-15 12:20:07,130 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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 42 states. [2022-04-15 12:20:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:07,131 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:20:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:20:07,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:07,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:07,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:07,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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:20:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 12:20:07,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 12:20:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:07,141 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 12:20:07,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 12:20:07,260 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:20:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:20:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:20:07,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:07,260 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:07,279 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:20:07,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2022-04-15 12:20:07,461 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-15 12:20:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:07,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331361111] [2022-04-15 12:20:07,494 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:20:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-15 12:20:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:07,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191202781] [2022-04-15 12:20:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:07,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:07,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-15 12:20:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:07,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176515020] [2022-04-15 12:20:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 12:20:08,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 12:20:08,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 12:20:08,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 12:20:08,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-15 12:20:08,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:08,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:08,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:08,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:08,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:08,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:08,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:08,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:08,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:08,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:08,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:08,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:08,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:08,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:08,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:20:08,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:20:08,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:20:08,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:20:08,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:20:08,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:20:08,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:20:08,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:20:08,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:20:08,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:20:08,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:20:08,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:20:08,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:20:08,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:20:08,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:08,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-15 12:20:08,444 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-15 12:20:08,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 12:20:08,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 12:20:08,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 12:20:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176515020] [2022-04-15 12:20:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176515020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711562268] [2022-04-15 12:20:08,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:08,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:08,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:08,446 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:20:08,450 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:20:09,354 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:20:09,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:09,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-15 12:20:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:09,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:09,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 12:20:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 12:20:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 12:20:09,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 12:20:09,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 12:20:09,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-15 12:20:09,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:09,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:09,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:09,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:09,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:09,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:09,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:09,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:09,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:09,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:09,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:09,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:09,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:09,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:09,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:09,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:20:09,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:20:09,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:20:09,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:20:09,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:20:09,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:20:09,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:20:09,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:20:09,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:20:09,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:20:09,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:20:09,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:20:09,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:20:09,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:20:09,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:20:09,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-15 12:20:09,880 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-15 12:20:09,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 12:20:09,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 12:20:09,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 12:20:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:09,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:24,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 12:20:24,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {12135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 12:20:24,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:20:24,324 INFO L272 TraceCheckUtils]: 37: Hoare triple {12143#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:20:24,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {12143#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:20:24,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-15 12:20:24,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 12:20:24,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:20:24,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 12:20:24,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 12:20:24,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 12:20:24,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 12:20:24,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 12:20:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:24,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711562268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:24,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:24,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-15 12:20:24,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:24,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331361111] [2022-04-15 12:20:24,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331361111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:24,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:24,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:20:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196310706] [2022-04-15 12:20:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:20:24,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:24,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:24,492 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:20:24,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:20:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:20:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:20:24,493 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:36,397 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:20:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:20:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:20:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:20:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:20:36,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 12:20:36,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:36,489 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:20:36,489 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:20:36,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 12:20:36,490 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:36,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 12:20:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:20:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:20:36,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:36,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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:20:36,533 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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:20:36,533 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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:20:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:36,534 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:20:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:20:36,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:36,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:36,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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 43 states. [2022-04-15 12:20:36,534 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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 43 states. [2022-04-15 12:20:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:36,535 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:20:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:20:36,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:36,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:36,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:36,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 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:20:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 12:20:36,535 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 12:20:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:36,536 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 12:20:36,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:36,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 12:20:36,673 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:20:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:20:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:20:36,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:36,674 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:36,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:36,874 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,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61 [2022-04-15 12:20:36,874 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-15 12:20:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:36,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184647091] [2022-04-15 12:20:36,913 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:20:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-15 12:20:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:36,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573300920] [2022-04-15 12:20:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:36,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:36,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-15 12:20:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:36,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006022666] [2022-04-15 12:20:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:37,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 12:20:37,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 12:20:37,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 12:20:37,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 12:20:37,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 12:20:37,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:37,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:37,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:37,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:37,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:37,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:37,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:37,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:37,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:37,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:37,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:37,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:37,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:37,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:37,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:20:37,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:20:37,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:20:37,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:20:37,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:20:37,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:20:37,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:20:37,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:20:37,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:20:37,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:20:37,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:20:37,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:20:37,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:20:37,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:20:37,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:20:37,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} is VALID [2022-04-15 12:20:37,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 12:20:37,544 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 12:20:37,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 12:20:37,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 12:20:37,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 12:20:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006022666] [2022-04-15 12:20:37,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006022666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069004005] [2022-04-15 12:20:37,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:20:37,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:37,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:37,546 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:20:37,547 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:20:37,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:20:37,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:37,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 12:20:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:37,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:38,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-15 12:20:38,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 12:20:38,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 12:20:38,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 12:20:38,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 12:20:38,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-15 12:20:38,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:38,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:38,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:38,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:38,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:38,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:38,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:38,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:38,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:38,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:38,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:38,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:38,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:38,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:38,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:38,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:20:38,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:20:38,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:20:38,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:20:38,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:20:38,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:20:38,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:20:38,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:20:38,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:20:38,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:20:38,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:20:38,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:20:38,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:20:38,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:20:38,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:20:38,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:20:38,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 12:20:38,134 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 12:20:38,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 12:20:38,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 12:20:38,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 12:20:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:38,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:53,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 12:20:53,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 12:20:53,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 12:20:53,725 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 12:20:53,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {12795#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 12:20:53,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12795#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:20:53,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 12:20:53,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 12:20:53,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 12:20:53,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 12:20:53,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-15 12:20:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:53,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069004005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:53,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:53,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 12:20:53,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:53,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184647091] [2022-04-15 12:20:53,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184647091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:53,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:53,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:20:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634500179] [2022-04-15 12:20:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:20:53,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:53,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:53,918 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:20:53,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:20:53,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:53,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:20:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=3335, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 12:20:53,919 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:06,739 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:21:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:21:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:21:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:21:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:21:06,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 12:21:06,830 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:21:06,831 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:21:06,831 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:21:06,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=2435, Invalid=7465, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 12:21:06,832 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:06,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 12:21:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:21:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:21:06,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:06,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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:21:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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:21:06,875 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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:21:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:06,875 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:21:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:21:06,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:06,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:06,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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 44 states. [2022-04-15 12:21:06,876 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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 44 states. [2022-04-15 12:21:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:06,876 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:21:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:21:06,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:06,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:06,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:06,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 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:21:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 12:21:06,878 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 12:21:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:06,878 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 12:21:06,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:06,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 12:21:06,998 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:21:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:21:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:21:06,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:06,998 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:07,017 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:21:07,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:07,212 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-15 12:21:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:07,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061812827] [2022-04-15 12:21:07,246 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-15 12:21:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623076266] [2022-04-15 12:21:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:07,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:07,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-15 12:21:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27942804] [2022-04-15 12:21:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:07,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 12:21:07,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 12:21:07,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 12:21:07,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:07,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 12:21:07,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 12:21:07,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 12:21:07,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 12:21:07,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-15 12:21:07,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:07,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:07,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:07,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:07,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:07,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:07,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:07,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:07,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:07,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:08,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:08,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:08,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:08,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:08,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:08,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:21:08,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:21:08,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:21:08,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:21:08,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:21:08,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:21:08,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:21:08,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:21:08,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:21:08,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:21:08,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:21:08,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:21:08,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:21:08,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:21:08,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:21:08,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:21:08,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:08,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 12:21:08,125 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 12:21:08,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 12:21:08,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 12:21:08,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 12:21:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27942804] [2022-04-15 12:21:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27942804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574782987] [2022-04-15 12:21:08,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:21:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:08,127 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:21:08,128 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:21:08,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:21:08,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:08,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 12:21:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:08,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:08,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-15 12:21:08,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 12:21:08,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 12:21:08,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 12:21:08,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 12:21:08,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-15 12:21:08,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:08,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:08,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:08,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:08,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:08,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:08,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:08,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:08,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:08,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:08,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:08,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:08,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:08,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:08,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:08,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:21:08,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:21:08,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:21:08,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:21:08,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:21:08,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:21:08,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:21:08,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:21:08,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:21:08,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:21:08,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:21:08,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:21:08,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:21:08,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:21:08,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:21:08,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:21:08,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:21:08,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 12:21:08,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 12:21:08,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 12:21:08,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 12:21:08,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 12:21:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:08,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:26,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 12:21:26,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 12:21:26,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 12:21:26,200 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 12:21:26,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {13459#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 12:21:26,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13459#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:26,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 12:21:26,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 12:21:26,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 12:21:26,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 12:21:26,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-15 12:21:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:26,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574782987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:26,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:26,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 12:21:26,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:26,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061812827] [2022-04-15 12:21:26,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061812827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:26,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:26,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:21:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573584001] [2022-04-15 12:21:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:26,325 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:21:26,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:26,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:26,369 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:21:26,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:21:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:21:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:21:26,370 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:39,635 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:21:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:21:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:21:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:21:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:21:39,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 12:21:39,730 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:21:39,730 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:21:39,730 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:21:39,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 12:21:39,731 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:39,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 12:21:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:21:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:21:39,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:39,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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:21:39,776 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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:21:39,776 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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:21:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:39,777 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:21:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:21:39,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:39,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:39,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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 45 states. [2022-04-15 12:21:39,777 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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 45 states. [2022-04-15 12:21:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:39,777 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:21:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:21:39,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:39,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:39,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:39,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 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:21:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 12:21:39,778 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 12:21:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:39,778 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 12:21:39,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:39,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 12:21:39,935 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:21:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:21:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:21:39,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:39,935 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:39,957 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:21:40,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:40,136 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-15 12:21:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:40,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054357655] [2022-04-15 12:21:40,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-15 12:21:40,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:40,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370714399] [2022-04-15 12:21:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:40,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:40,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:40,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-15 12:21:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094037858] [2022-04-15 12:21:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:40,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 12:21:40,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:40,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 12:21:40,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-15 12:21:40,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:40,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:40,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:40,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:40,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:40,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:40,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:40,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:40,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:40,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:40,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:40,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:40,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:40,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:40,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:40,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:21:40,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:21:40,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:21:40,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:21:40,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:21:40,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:21:40,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:21:40,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:21:40,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:21:40,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:21:40,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:21:40,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:21:40,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:21:40,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:21:40,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:21:40,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:21:40,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:21:40,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} is VALID [2022-04-15 12:21:40,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-15 12:21:40,993 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-15 12:21:40,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-15 12:21:40,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 12:21:40,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 12:21:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:40,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094037858] [2022-04-15 12:21:40,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094037858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:40,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738592447] [2022-04-15 12:21:40,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:40,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:40,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:40,995 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:21:40,996 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:21:42,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 12:21:42,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:42,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 12:21:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:42,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:42,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-15 12:21:42,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 12:21:42,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 12:21:42,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 12:21:42,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 12:21:42,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-15 12:21:42,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:42,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:42,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:42,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:42,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:42,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:42,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:42,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:42,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:42,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:42,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:42,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:42,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:42,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:42,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:42,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:21:42,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:21:42,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:21:42,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:21:42,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:21:42,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:21:42,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:21:42,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:21:42,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:21:42,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:21:42,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:21:42,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:21:42,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:21:42,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:21:42,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:21:42,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:21:42,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:21:42,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:21:42,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-15 12:21:42,820 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-15 12:21:42,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-15 12:21:42,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 12:21:42,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 12:21:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:42,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:05,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 12:22:05,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {14130#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 12:22:05,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {14134#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14130#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:22:05,121 INFO L272 TraceCheckUtils]: 40: Hoare triple {14138#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14134#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:05,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {14138#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 12:22:05,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 12:22:05,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:22:05,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 12:22:05,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 12:22:05,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 12:22:05,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 12:22:05,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-15 12:22:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738592447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:05,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:05,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-15 12:22:05,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054357655] [2022-04-15 12:22:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054357655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:05,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:05,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:22:05,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265227268] [2022-04-15 12:22:05,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:22:05,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:05,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:05,374 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:22:05,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:22:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:05,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:22:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:22:05,376 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:26,468 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:22:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:22:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:22:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:22:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:22:26,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 12:22:26,563 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:22:26,564 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:22:26,564 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:22:26,565 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 12:22:26,565 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:26,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 12:22:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:22:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 12:22:26,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:26,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,610 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,610 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:26,611 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:22:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:22:26,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:26,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:26,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:22:26,611 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:22:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:26,611 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:22:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:22:26,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:26,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:26,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:26,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 12:22:26,612 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 12:22:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:26,612 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 12:22:26,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:26,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 12:22:26,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:22:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:22:26,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:26,800 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:26,805 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 12:22:27,000 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,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2022-04-15 12:22:27,001 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-15 12:22:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:27,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826175294] [2022-04-15 12:22:27,032 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:22:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-15 12:22:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744647791] [2022-04-15 12:22:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:27,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:22:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:27,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:22:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-15 12:22:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443857807] [2022-04-15 12:22:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:27,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 12:22:27,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 12:22:27,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 12:22:27,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:27,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 12:22:27,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 12:22:27,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 12:22:27,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 12:22:27,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-15 12:22:27,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:27,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:27,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:27,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:27,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:27,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:27,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:27,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:27,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:27,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:27,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:27,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:27,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:27,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:27,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:27,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:22:27,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:22:27,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:22:27,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:22:27,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:22:27,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:22:27,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:22:27,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:22:27,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:22:27,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:22:27,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:22:27,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:22:27,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:22:27,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:22:27,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:22:27,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:22:27,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:22:27,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:22:27,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:22:27,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 12:22:27,867 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 12:22:27,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 12:22:27,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 12:22:27,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 12:22:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443857807] [2022-04-15 12:22:27,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443857807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638440757] [2022-04-15 12:22:27,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:22:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:27,869 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 12:22:27,870 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 12:22:27,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:22:27,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:27,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 12:22:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:27,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:28,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-15 12:22:28,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 12:22:28,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 12:22:28,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 12:22:28,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 12:22:28,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-15 12:22:28,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:28,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:28,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:28,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:28,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:28,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:28,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:28,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:28,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:28,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:28,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:28,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:28,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:28,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:28,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:28,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:22:28,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:22:28,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:22:28,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:22:28,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:22:28,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:22:28,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:22:28,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:22:28,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:22:28,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:22:28,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:22:28,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:22:28,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:22:28,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:22:28,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:22:28,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:22:28,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:22:28,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:22:28,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:22:28,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 12:22:28,518 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 12:22:28,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 12:22:28,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 12:22:28,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 12:22:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:28,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:01,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 12:23:01,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 12:23:01,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 12:23:01,486 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 12:23:01,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {14838#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 12:23:01,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14838#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:23:01,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 12:23:01,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 12:23:01,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 12:23:01,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 12:23:01,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-15 12:23:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638440757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:01,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:01,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 12:23:01,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826175294] [2022-04-15 12:23:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826175294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:01,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:01,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:23:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252343695] [2022-04-15 12:23:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:23:01,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:01,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:01,950 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:23:01,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:23:01,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:23:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:23:01,951 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:25,862 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:23:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:23:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:23:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:23:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:23:25,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 12:23:25,983 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:23:25,984 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:23:25,984 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:23:25,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=2873, Invalid=8899, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 12:23:25,985 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:25,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-04-15 12:23:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:23:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:23:26,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:26,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,031 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,031 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:26,032 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:23:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:23:26,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:26,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:26,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:23:26,032 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:23:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:26,032 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:23:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:23:26,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:26,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:26,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:26,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 12:23:26,033 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 12:23:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:26,033 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 12:23:26,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 12:23:26,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:23:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:23:26,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:26,192 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:26,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 12:23:26,392 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,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2022-04-15 12:23:26,392 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-15 12:23:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818602713] [2022-04-15 12:23:26,426 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:23:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-15 12:23:26,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:26,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297127470] [2022-04-15 12:23:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:26,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:23:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:26,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:23:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-15 12:23:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:26,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699563315] [2022-04-15 12:23:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:27,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 12:23:27,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 12:23:27,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 12:23:27,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:27,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 12:23:27,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 12:23:27,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 12:23:27,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 12:23:27,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-15 12:23:27,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:23:27,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:23:27,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:23:27,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:23:27,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:23:27,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:23:27,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:23:27,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:23:27,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:23:27,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:23:27,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:23:27,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:23:27,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:23:27,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:23:27,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:23:27,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:23:27,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:23:27,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:23:27,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:23:27,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:23:27,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:23:27,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:23:27,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:23:27,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:23:27,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:23:27,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:23:27,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:23:27,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:23:27,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:23:27,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:23:27,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:23:27,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:23:27,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:23:27,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:23:27,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:23:27,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 12:23:27,496 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 12:23:27,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 12:23:27,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 12:23:27,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 12:23:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699563315] [2022-04-15 12:23:27,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699563315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266029358] [2022-04-15 12:23:27,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:23:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:27,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:27,497 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 12:23:27,501 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 12:23:27,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:23:27,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:27,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 12:23:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:27,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:28,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-15 12:23:28,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 12:23:28,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 12:23:28,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 12:23:28,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 12:23:28,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-15 12:23:28,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:23:28,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:23:28,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:23:28,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:23:28,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:23:28,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:23:28,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:23:28,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:23:28,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:23:28,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:23:28,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:23:28,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:23:28,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:23:28,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:23:28,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:23:28,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:23:28,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:23:28,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:23:28,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:23:28,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:23:28,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:23:28,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:23:28,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:23:28,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:23:28,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:23:28,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:23:28,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:23:28,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:23:28,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:23:28,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:23:28,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:23:28,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:23:28,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:23:28,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:23:28,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:23:28,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 12:23:28,311 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 12:23:28,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 12:23:28,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 12:23:28,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 12:23:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:28,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:14,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 12:24:14,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 12:24:14,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 12:24:14,287 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 12:24:14,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {15550#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 12:24:14,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15550#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 12:24:14,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 12:24:14,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 12:24:14,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 12:24:14,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 12:24:14,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-15 12:24:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:14,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266029358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:14,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:14,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 12:24:14,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818602713] [2022-04-15 12:24:14,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818602713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:14,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:14,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:24:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436616566] [2022-04-15 12:24:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:24:14,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:14,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:14,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:14,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:24:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:24:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 12:24:14,814 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:45,209 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:24:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:24:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:24:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:24:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:24:45,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 12:24:45,312 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:24:45,313 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:24:45,313 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:24:45,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 12:24:45,314 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:45,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-04-15 12:24:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:24:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 12:24:45,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:45,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,362 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,362 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:45,362 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:24:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:24:45,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:45,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:45,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:24:45,363 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:24:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:45,363 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:24:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:24:45,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:45,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:45,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:45,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 12:24:45,364 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 12:24:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:45,364 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 12:24:45,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:45,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 12:24:45,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:24:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:24:45,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:45,567 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:45,596 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 12:24:45,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:45,768 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-15 12:24:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:45,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623398109] [2022-04-15 12:24:45,801 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:24:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-15 12:24:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:45,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341919280] [2022-04-15 12:24:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:45,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:24:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:45,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:24:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-15 12:24:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:45,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111526364] [2022-04-15 12:24:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:46,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 12:24:46,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 12:24:46,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 12:24:46,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:46,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 12:24:46,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 12:24:46,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 12:24:46,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 12:24:46,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-15 12:24:46,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:46,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:46,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:46,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:46,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:46,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:46,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:46,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:46,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:46,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:46,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:46,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:46,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:46,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:46,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:46,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:46,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:24:46,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:24:46,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:24:46,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:24:46,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:24:46,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:24:46,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:24:46,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:24:46,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:24:46,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:24:46,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:24:46,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:24:46,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:24:46,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:24:46,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:24:46,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:24:46,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:24:46,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:24:46,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:24:46,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} is VALID [2022-04-15 12:24:46,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-15 12:24:46,917 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-15 12:24:46,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-15 12:24:46,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 12:24:46,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 12:24:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:46,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111526364] [2022-04-15 12:24:46,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111526364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:46,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872480419] [2022-04-15 12:24:46,918 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:24:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:46,919 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 12:24:46,920 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 12:24:49,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 12:24:49,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:49,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 12:24:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:49,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:49,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-15 12:24:49,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 12:24:49,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 12:24:49,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 12:24:49,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 12:24:49,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-15 12:24:49,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:49,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:49,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:49,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:49,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:49,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:49,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:49,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:49,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:49,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:49,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:49,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:49,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:49,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:49,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:49,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:49,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:24:50,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:24:50,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:24:50,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:24:50,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:24:50,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:24:50,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:24:50,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:24:50,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:24:50,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:24:50,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:24:50,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:24:50,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:24:50,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:24:50,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:24:50,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:24:50,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:24:50,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:24:50,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:24:50,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:24:50,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-15 12:24:50,158 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-15 12:24:50,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-15 12:24:50,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 12:24:50,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 12:24:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:29,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 12:25:29,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {16269#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 12:25:29,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {16273#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16269#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:25:29,890 INFO L272 TraceCheckUtils]: 43: Hoare triple {16277#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16273#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:29,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {16277#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 12:25:29,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 12:25:29,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:25:29,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:25:30,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 12:25:30,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 12:25:30,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 12:25:30,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 12:25:30,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-15 12:25:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:25:30,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872480419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:30,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-15 12:25:30,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:30,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623398109] [2022-04-15 12:25:30,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623398109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:25:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209434143] [2022-04-15 12:25:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:25:30,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:30,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:30,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:30,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:25:30,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:30,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:25:30,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:25:30,195 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:07,325 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:26:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:26:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:26:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:26:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:26:07,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 12:26:07,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:07,469 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:26:07,469 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:26:07,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 12:26:07,470 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:07,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2022-04-15 12:26:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:26:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:26:07,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:07,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,520 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,520 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:07,520 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:26:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:26:07,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:07,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:07,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:26:07,521 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:26:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:07,521 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:26:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:26:07,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:07,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:07,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:07,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 12:26:07,524 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 12:26:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:07,524 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 12:26:07,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 12:26:07,758 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:26:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:26:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:26:07,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:07,759 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:07,764 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 12:26:07,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:07,959 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:07,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-15 12:26:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:07,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912158253] [2022-04-15 12:26:07,995 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:26:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-15 12:26:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120181982] [2022-04-15 12:26:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:26:08,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:26:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:26:08,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:26:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-15 12:26:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:08,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801663746] [2022-04-15 12:26:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:08,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:08,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 12:26:08,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-15 12:26:08,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:26:08,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:26:08,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:26:08,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:26:08,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:26:08,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:26:08,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:26:08,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:26:08,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:26:08,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:26:08,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:26:08,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:26:08,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:26:09,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:26:09,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:26:09,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:26:09,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:26:09,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:26:09,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:26:09,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:26:09,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:26:09,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:26:09,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:26:09,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:26:09,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:26:09,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:26:09,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:26:09,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:26:09,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:26:09,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:26:09,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:26:09,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:26:09,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:26:09,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:26:09,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:26:09,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:26:09,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} is VALID [2022-04-15 12:26:09,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 12:26:09,271 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 12:26:09,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 12:26:09,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 12:26:09,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 12:26:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:26:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:09,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801663746] [2022-04-15 12:26:09,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801663746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:26:09,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196632155] [2022-04-15 12:26:09,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:26:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:26:09,273 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 12:26:09,274 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 12:26:09,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:26:09,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:26:09,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-15 12:26:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:09,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:26:09,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 12:26:09,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 12:26:09,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 12:26:09,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 12:26:09,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 12:26:09,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-15 12:26:09,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:26:09,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:26:09,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:26:09,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:26:09,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:26:09,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:26:09,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:26:09,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:26:09,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:26:09,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:26:09,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:26:09,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:26:09,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:26:09,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:26:09,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:26:09,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:26:09,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:26:09,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:26:10,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:26:10,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:26:10,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:26:10,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:26:10,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:26:10,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:26:10,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:26:10,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:26:10,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:26:10,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:26:10,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:26:10,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:26:10,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:26:10,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:26:10,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:26:10,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:26:10,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:26:10,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:26:10,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 12:26:10,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 12:26:10,205 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 12:26:10,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 12:26:10,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 12:26:10,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 12:26:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:26:10,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:42,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 12:27:42,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 12:27:42,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 12:27:42,559 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 12:27:42,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {17025#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 12:27:42,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17025#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:27:42,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 12:27:43,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 12:27:43,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 12:27:43,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 12:27:43,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 12:27:43,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 12:27:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:43,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196632155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:43,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:43,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 12:27:43,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:43,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912158253] [2022-04-15 12:27:43,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912158253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:43,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:43,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:27:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423025279] [2022-04-15 12:27:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:27:43,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:43,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:43,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:43,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:27:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:27:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:27:43,257 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:28:34,297 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:28:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:28:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:28:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:28:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:28:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:28:34,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 12:28:34,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:28:34,453 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:28:34,453 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:28:34,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 92.2s TimeCoverageRelationStatistics Valid=3347, Invalid=10459, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 12:28:34,455 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:28:34,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2022-04-15 12:28:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:28:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 12:28:34,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:28:34,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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:28:34,508 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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:28:34,508 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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:28:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:28:34,509 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:28:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:28:34,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:28:34,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:28:34,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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 50 states. [2022-04-15 12:28:34,509 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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 50 states. [2022-04-15 12:28:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:28:34,510 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:28:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:28:34,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:28:34,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:28:34,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:28:34,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:28:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 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:28:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 12:28:34,511 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 12:28:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:28:34,512 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 12:28:34,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:34,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 12:28:34,769 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:28:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:28:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:28:34,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:28:34,770 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:28:34,787 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 12:28:34,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:28:34,970 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:28:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:28:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-15 12:28:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:28:34,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105074193] [2022-04-15 12:28:35,005 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:28:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-15 12:28:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:28:35,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024403935] [2022-04-15 12:28:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:28:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:28:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:28:35,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:28:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:28:35,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:28:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-15 12:28:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:28:35,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539759754] [2022-04-15 12:28:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:28:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:28:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:28:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:28:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:28:35,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 12:28:35,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 12:28:35,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 12:28:35,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:28:35,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 12:28:35,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 12:28:35,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 12:28:35,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 12:28:35,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-15 12:28:35,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:28:35,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:28:35,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:28:35,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:28:35,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:28:35,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:28:35,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:28:35,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:28:36,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:28:36,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:28:36,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:28:36,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:28:36,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:28:36,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:28:36,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:28:36,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:28:36,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:28:36,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:28:36,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:28:36,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:28:36,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:28:36,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:28:36,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:28:36,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:28:36,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:28:36,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:28:36,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:28:36,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:28:36,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:28:36,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:28:36,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:28:36,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:28:36,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:28:36,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:28:36,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:28:36,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:28:36,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 12:28:36,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:28:36,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 12:28:36,403 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 12:28:36,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 12:28:36,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 12:28:36,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 12:28:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:28:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:28:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539759754] [2022-04-15 12:28:36,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539759754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:28:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584407670] [2022-04-15 12:28:36,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:28:36,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:28:36,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:28:36,405 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 12:28:36,406 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 12:28:36,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:28:36,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:28:36,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 12:28:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:28:36,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:28:36,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-15 12:28:36,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 12:28:36,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 12:28:36,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 12:28:36,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 12:28:36,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-15 12:28:36,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:28:36,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:28:36,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:28:37,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:28:37,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:28:37,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:28:37,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:28:37,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:28:37,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:28:37,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:28:37,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:28:37,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:28:37,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:28:37,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:28:37,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:28:37,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:28:37,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:28:37,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:28:37,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:28:37,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:28:37,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:28:37,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:28:37,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:28:37,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:28:37,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:28:37,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:28:37,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:28:37,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:28:37,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:28:37,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:28:37,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:28:37,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:28:37,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:28:37,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:28:37,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:28:37,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:28:37,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 12:28:37,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 12:28:37,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 12:28:37,472 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 12:28:37,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 12:28:37,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 12:28:37,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 12:28:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:28:37,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:30:26,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 12:30:26,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 12:30:26,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 12:30:26,231 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 12:30:26,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {17785#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 12:30:26,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17785#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:30:26,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 12:30:26,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 12:30:26,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 12:30:26,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 12:30:26,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-15 12:30:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584407670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:30:26,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:30:26,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 12:30:26,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105074193] [2022-04-15 12:30:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105074193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:26,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:26,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:30:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787954459] [2022-04-15 12:30:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:30:26,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:26,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:27,036 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:30:27,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:30:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:30:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:30:27,038 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,102 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 12:31:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:31:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:31:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 12:31:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 12:31:19,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 12:31:19,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:19,262 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:31:19,262 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:31:19,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 108.4s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 12:31:19,263 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:19,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2022-04-15 12:31:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:31:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:31:19,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:19,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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:31:19,315 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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:31:19,315 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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:31:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,316 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:31:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:31:19,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:19,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:19,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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 51 states. [2022-04-15 12:31:19,316 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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 51 states. [2022-04-15 12:31:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:19,317 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:31:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:31:19,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:19,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:19,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:19,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 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:31:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 12:31:19,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 12:31:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:19,318 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 12:31:19,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:19,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 12:31:19,634 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:31:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:31:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:31:19,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:19,635 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:19,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 12:31:19,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77 [2022-04-15 12:31:19,836 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-15 12:31:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:19,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542523583] [2022-04-15 12:31:19,872 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:31:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-15 12:31:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:19,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166346961] [2022-04-15 12:31:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:31:19,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:31:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:31:19,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:31:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-15 12:31:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:19,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381975423] [2022-04-15 12:31:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:20,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 12:31:20,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 12:31:20,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-15 12:31:20,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:31:20,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:31:20,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:31:20,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:31:20,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:31:20,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:31:20,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:31:20,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:31:20,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:31:20,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:31:20,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:31:20,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:31:20,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:31:20,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:31:20,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:31:20,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:31:20,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:31:21,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:31:21,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:31:21,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:31:21,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:31:21,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:31:21,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:31:21,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:31:21,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:31:21,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:31:21,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:31:21,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:31:21,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:31:21,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:31:21,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:31:21,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:31:21,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:31:21,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:31:21,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:31:21,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:31:21,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 12:31:21,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 12:31:21,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} is VALID [2022-04-15 12:31:21,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-15 12:31:21,305 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-15 12:31:21,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-15 12:31:21,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 12:31:21,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 12:31:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:21,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381975423] [2022-04-15 12:31:21,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381975423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:31:21,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475908934] [2022-04-15 12:31:21,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:31:21,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:31:21,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:21,307 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:31:21,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 12:31:25,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-15 12:31:25,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:31:25,783 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 87 conjunts are in the unsatisfiable core [2022-04-15 12:31:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:25,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:31:26,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-15 12:31:26,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 12:31:26,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 12:31:26,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 12:31:26,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 12:31:26,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-15 12:31:26,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:31:26,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:31:26,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:31:26,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:31:26,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:31:26,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:31:26,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:31:26,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:31:26,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:31:26,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:31:26,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:31:26,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:31:26,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:31:26,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:31:26,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:31:26,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:31:26,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:31:26,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:31:26,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 12:31:26,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 12:31:26,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 12:31:26,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 12:31:26,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 12:31:26,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 12:31:26,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 12:31:26,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 12:31:26,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 12:31:26,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 12:31:26,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 12:31:26,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 12:31:26,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 12:31:26,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 12:31:26,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 12:31:26,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 12:31:26,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 12:31:26,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 12:31:26,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 12:31:26,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 12:31:26,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 12:31:26,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-15 12:31:26,682 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-15 12:31:26,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-15 12:31:26,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 12:31:26,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 12:31:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:26,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:19,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 12:32:19,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {18552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 12:32:19,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:19,015 INFO L272 TraceCheckUtils]: 46: Hoare triple {18560#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:19,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {18560#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:32:19,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 12:32:19,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 12:32:19,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 12:32:19,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 12:32:19,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 12:32:19,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 12:32:19,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-15 12:32:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475908934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:19,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:19,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 45] total 87 [2022-04-15 12:32:19,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:19,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542523583] [2022-04-15 12:32:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542523583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:19,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:19,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:32:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59035473] [2022-04-15 12:32:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:32:19,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:19,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:19,457 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:32:19,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:32:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:32:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:32:19,459 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)