/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:06:09,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:06:09,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:06:10,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:06:10,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:06:10,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:06:10,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:06:10,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:06:10,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:06:10,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:06:10,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:06:10,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:06:10,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:06:10,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:06:10,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:06:10,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:06:10,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:06:10,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:06:10,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:06:10,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:06:10,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:06:10,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:06:10,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:06:10,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:06:10,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:06:10,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:06:10,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:06:10,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:06:10,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:06:10,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:06:10,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:06:10,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:06:10,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:06:10,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:06:10,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:06:10,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:06:10,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:06:10,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:06:10,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:06:10,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:06:10,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:06:10,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:06:10,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:06:10,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:06:10,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:06:10,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:06:10,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:06:10,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:06:10,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:06:10,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:06:10,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:06:10,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:06:10,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:06:10,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:06:10,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:06:10,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:06:10,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:06:10,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:06:10,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:06:10,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:06:10,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:06:10,090 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:06:10,090 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:06:10,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:06:10,090 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:06:10,091 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-08 10:06:10,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:06:10,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:06:10,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:06:10,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:06:10,329 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:06:10,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-08 10:06:10,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b01caf10/2c0ca12e690b4fb9a8e514bd18fe82d0/FLAGa8a39910e [2022-04-08 10:06:10,765 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:06:10,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-08 10:06:10,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b01caf10/2c0ca12e690b4fb9a8e514bd18fe82d0/FLAGa8a39910e [2022-04-08 10:06:10,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b01caf10/2c0ca12e690b4fb9a8e514bd18fe82d0 [2022-04-08 10:06:10,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:06:10,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:06:10,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:06:10,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:06:10,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:06:10,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:06:10" (1/1) ... [2022-04-08 10:06:10,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cece9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:10, skipping insertion in model container [2022-04-08 10:06:10,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:06:10" (1/1) ... [2022-04-08 10:06:10,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:06:10,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:06:11,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-08 10:06:11,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:06:11,033 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:06:11,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-08 10:06:11,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:06:11,072 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:06:11,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11 WrapperNode [2022-04-08 10:06:11,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:06:11,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:06:11,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:06:11,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:06:11,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:06:11,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:06:11,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:06:11,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:06:11,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (1/1) ... [2022-04-08 10:06:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:06:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:11,149 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-08 10:06:11,158 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-08 10:06:11,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:06:11,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:06:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:06:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:06:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:06:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:06:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:06:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:06:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:06:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:06:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:06:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:06:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:06:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:06:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:06:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:06:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:06:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:06:11,246 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:06:11,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:06:11,476 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:06:11,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:06:11,481 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 10:06:11,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:06:11 BoogieIcfgContainer [2022-04-08 10:06:11,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:06:11,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:06:11,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:06:11,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:06:11,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:06:10" (1/3) ... [2022-04-08 10:06:11,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774daf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:06:11, skipping insertion in model container [2022-04-08 10:06:11,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:06:11" (2/3) ... [2022-04-08 10:06:11,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774daf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:06:11, skipping insertion in model container [2022-04-08 10:06:11,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:06:11" (3/3) ... [2022-04-08 10:06:11,488 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-08 10:06:11,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:06:11,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:06:11,532 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:06:11,539 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-08 10:06:11,539 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:06:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:06:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:06:11,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:11,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:11,564 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-08 10:06:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:11,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377706167] [2022-04-08 10:06:11,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:06:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-08 10:06:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:11,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753184443] [2022-04-08 10:06:11,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:11,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 10:06:11,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:06:11,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 10:06:11,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:11,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 10:06:11,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:06:11,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 10:06:11,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-08 10:06:11,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-08 10:06:11,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:11,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-08 10:06:11,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:11,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 10:06:11,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-08 10:06:11,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-08 10:06:11,760 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-08 10:06:11,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 10:06:11,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 10:06:11,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 10:06:11,761 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-08 10:06:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:11,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753184443] [2022-04-08 10:06:11,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753184443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:11,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:11,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:06:11,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377706167] [2022-04-08 10:06:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377706167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:11,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:11,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:06:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889177966] [2022-04-08 10:06:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:06:11,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:11,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,791 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-08 10:06:11,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:06:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:06:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:06:11,810 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:11,883 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-08 10:06:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:06:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:06:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 10:06:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 10:06:11,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 10:06:11,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:11,968 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:06:11,968 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:06:11,971 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-08 10:06:11,973 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:11,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:06:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:06:11,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:11,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,998 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:11,999 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,001 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 10:06:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:12,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:06:12,003 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:06:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,005 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 10:06:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:12,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:12,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-08 10:06:12,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-08 10:06:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:12,009 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-08 10:06:12,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-08 10:06:12,033 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-08 10:06:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 10:06:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:06:12,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:12,034 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:12,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:06:12,035 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-08 10:06:12,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:12,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324448523] [2022-04-08 10:06:12,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:06:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-08 10:06:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:12,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967811624] [2022-04-08 10:06:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 10:06:12,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 10:06:12,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 10:06:12,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:12,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 10:06:12,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 10:06:12,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 10:06:12,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-08 10:06:12,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:12,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:12,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:12,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-08 10:06:12,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-08 10:06:12,242 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-08 10:06:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:12,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967811624] [2022-04-08 10:06:12,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967811624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:12,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:12,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324448523] [2022-04-08 10:06:12,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324448523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253273235] [2022-04-08 10:06:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:06:12,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:12,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,260 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-08 10:06:12,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:06:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:06:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:06:12,262 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,430 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-08 10:06:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:06:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:06:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 10:06:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 10:06:12,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-08 10:06:12,471 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-08 10:06:12,472 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:06:12,472 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:06:12,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:06:12,474 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:12,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:06:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:06:12,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:12,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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-08 10:06:12,481 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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-08 10:06:12,481 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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-08 10:06:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,483 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-08 10:06:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-08 10:06:12,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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 23 states. [2022-04-08 10:06:12,484 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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 23 states. [2022-04-08 10:06:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,486 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-08 10:06:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-08 10:06:12,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:12,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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-08 10:06:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-08 10:06:12,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-08 10:06:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:12,489 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-08 10:06:12,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-08 10:06:12,520 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-08 10:06:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-08 10:06:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:12,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:12,522 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:12,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:06:12,523 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-08 10:06:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:12,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226069460] [2022-04-08 10:06:12,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-08 10:06:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407424537] [2022-04-08 10:06:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-08 10:06:12,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-08 10:06:12,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-08 10:06:12,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:12,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-08 10:06:12,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-08 10:06:12,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-08 10:06:12,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret15 := main(); {350#true} is VALID [2022-04-08 10:06:12,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {350#true} is VALID [2022-04-08 10:06:12,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#true} assume !(~x~0 % 4294967296 > 0); {350#true} is VALID [2022-04-08 10:06:12,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} ~z~0 := ~y~0; {350#true} is VALID [2022-04-08 10:06:12,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#true} assume !(~z~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:12,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:12,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 10:06:12,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {351#false} is VALID [2022-04-08 10:06:12,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} assume !(~z~0 % 4294967296 > 0); {351#false} is VALID [2022-04-08 10:06:12,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#false} is VALID [2022-04-08 10:06:12,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} ~cond := #in~cond; {351#false} is VALID [2022-04-08 10:06:12,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume 0 == ~cond; {351#false} is VALID [2022-04-08 10:06:12,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-04-08 10:06:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:12,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407424537] [2022-04-08 10:06:12,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407424537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:12,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226069460] [2022-04-08 10:06:12,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226069460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372781434] [2022-04-08 10:06:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:12,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:12,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:12,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,659 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-08 10:06:12,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:06:12,660 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,754 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-08 10:06:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:06:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:06:12,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 10:06:12,795 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-08 10:06:12,797 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:06:12,797 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:06:12,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:12,800 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:12,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:06:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 10:06:12,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:12,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-08 10:06:12,824 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-08 10:06:12,825 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-08 10:06:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,829 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 10:06:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 10:06:12,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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 28 states. [2022-04-08 10:06:12,830 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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 28 states. [2022-04-08 10:06:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,832 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 10:06:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 10:06:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:12,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-08 10:06:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-08 10:06:12,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-08 10:06:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:12,839 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-08 10:06:12,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:12,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-08 10:06:12,883 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-08 10:06:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 10:06:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:12,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:12,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:12,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:06:12,888 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-08 10:06:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:12,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704678222] [2022-04-08 10:06:12,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-08 10:06:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:12,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480480884] [2022-04-08 10:06:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:12,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-08 10:06:12,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-08 10:06:12,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-08 10:06:12,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:12,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-08 10:06:12,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-08 10:06:12,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-08 10:06:12,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret15 := main(); {543#true} is VALID [2022-04-08 10:06:12,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {543#true} is VALID [2022-04-08 10:06:12,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume !(~x~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:12,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:12,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:12,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:06:12,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {544#false} is VALID [2022-04-08 10:06:12,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-08 10:06:12,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~z~0 % 4294967296 > 0); {544#false} is VALID [2022-04-08 10:06:12,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-08 10:06:12,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-08 10:06:12,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-08 10:06:12,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-08 10:06:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:12,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480480884] [2022-04-08 10:06:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480480884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:12,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704678222] [2022-04-08 10:06:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704678222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:12,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:12,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:06:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354167578] [2022-04-08 10:06:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:12,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:12,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,009 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-08 10:06:13,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:06:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:06:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:06:13,010 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,138 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-08 10:06:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:06:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 10:06:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 10:06:13,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 10:06:13,179 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-08 10:06:13,181 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:06:13,181 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:06:13,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:13,182 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:13,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:06:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 10:06:13,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:13,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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-08 10:06:13,214 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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-08 10:06:13,215 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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-08 10:06:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,216 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-08 10:06:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-08 10:06:13,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:13,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:13,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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 34 states. [2022-04-08 10:06:13,217 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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 34 states. [2022-04-08 10:06:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,219 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-08 10:06:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-08 10:06:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:13,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:13,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:13,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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-08 10:06:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-08 10:06:13,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-08 10:06:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:13,221 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-08 10:06:13,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-08 10:06:13,268 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-08 10:06:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-08 10:06:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:13,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:13,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:13,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 10:06:13,269 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-08 10:06:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:13,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570769510] [2022-04-08 10:06:13,285 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:13,285 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 2 times [2022-04-08 10:06:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:13,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454727195] [2022-04-08 10:06:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:13,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-08 10:06:13,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 10:06:13,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-08 10:06:13,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:13,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-08 10:06:13,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 10:06:13,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-08 10:06:13,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-08 10:06:13,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= main_~y~0 0)} is VALID [2022-04-08 10:06:13,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {779#(= main_~y~0 0)} is VALID [2022-04-08 10:06:13,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(= main_~y~0 0)} ~z~0 := ~y~0; {780#(= main_~z~0 0)} is VALID [2022-04-08 10:06:13,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {775#false} is VALID [2022-04-08 10:06:13,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-08 10:06:13,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#false} assume !(~y~0 % 4294967296 > 0); {775#false} is VALID [2022-04-08 10:06:13,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#false} assume !(~x~0 % 4294967296 > 0); {775#false} is VALID [2022-04-08 10:06:13,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-08 10:06:13,334 INFO L272 TraceCheckUtils]: 13: Hoare triple {775#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-08 10:06:13,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-08 10:06:13,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-08 10:06:13,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-08 10:06:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454727195] [2022-04-08 10:06:13,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454727195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:13,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:13,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:13,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:13,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570769510] [2022-04-08 10:06:13,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570769510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:13,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:13,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381196612] [2022-04-08 10:06:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:13,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:13,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,349 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-08 10:06:13,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:06:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:06:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:13,350 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,506 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-04-08 10:06:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:06:13,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-08 10:06:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-08 10:06:13,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-08 10:06:13,550 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-08 10:06:13,551 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:06:13,551 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:06:13,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:06:13,552 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:13,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:06:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:06:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 10:06:13,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:13,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-08 10:06:13,568 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-08 10:06:13,568 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-08 10:06:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,569 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-08 10:06:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-08 10:06:13,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:13,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:13,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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 26 states. [2022-04-08 10:06:13,570 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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 26 states. [2022-04-08 10:06:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,572 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-08 10:06:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-08 10:06:13,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:13,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:13,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:13,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-08 10:06:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-04-08 10:06:13,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2022-04-08 10:06:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:13,575 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-04-08 10:06:13,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 10:06:13,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 35 transitions. [2022-04-08 10:06:13,621 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-08 10:06:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-08 10:06:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:06:13,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:13,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:13,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 10:06:13,626 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-08 10:06:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475723619] [2022-04-08 10:06:13,631 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:13,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 2 times [2022-04-08 10:06:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:13,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091660363] [2022-04-08 10:06:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:13,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-08 10:06:13,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-08 10:06:13,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-08 10:06:13,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:13,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-08 10:06:13,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-08 10:06:13,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-08 10:06:13,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-08 10:06:13,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {985#(= main_~y~0 0)} is VALID [2022-04-08 10:06:13,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:13,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:13,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {987#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:13,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {987#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:13,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:13,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:13,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:13,746 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-08 10:06:13,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-08 10:06:13,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-08 10:06:13,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-08 10:06:13,746 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-08 10:06:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091660363] [2022-04-08 10:06:13,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091660363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131141007] [2022-04-08 10:06:13,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:13,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:13,749 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-08 10:06:13,751 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-08 10:06:13,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:13,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:13,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:06:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:13,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:14,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2022-04-08 10:06:14,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-08 10:06:14,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-08 10:06:14,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-08 10:06:14,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-08 10:06:14,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {985#(= main_~y~0 0)} is VALID [2022-04-08 10:06:14,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:14,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:14,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:14,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,100 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-08 10:06:14,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-08 10:06:14,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-08 10:06:14,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-08 10:06:14,101 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-08 10:06:14,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:14,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-08 10:06:14,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-08 10:06:14,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-08 10:06:14,201 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-08 10:06:14,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-08 10:06:14,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1062#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:14,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1066#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:14,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1066#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:14,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1073#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:14,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-08 10:06:14,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-08 10:06:14,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-08 10:06:14,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-08 10:06:14,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2022-04-08 10:06:14,206 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-08 10:06:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131141007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:14,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:14,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:06:14,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475723619] [2022-04-08 10:06:14,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475723619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:14,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:14,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:06:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534586619] [2022-04-08 10:06:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:14,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:14,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,229 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-08 10:06:14,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:06:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:06:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:06:14,230 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,497 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-08 10:06:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:06:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:06:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 10:06:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-08 10:06:14,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-08 10:06:14,552 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-08 10:06:14,553 INFO L225 Difference]: With dead ends: 52 [2022-04-08 10:06:14,553 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:06:14,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:14,554 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:14,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:06:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-08 10:06:14,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:14,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,583 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,583 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,584 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-08 10:06:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-08 10:06:14,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:14,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:14,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:06:14,585 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:06:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,587 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-08 10:06:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-08 10:06:14,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:14,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:14,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:14,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-08 10:06:14,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-08 10:06:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:14,589 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-08 10:06:14,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-08 10:06:14,638 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-08 10:06:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:06:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:06:14,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:14,639 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:14,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:06:14,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 10:06:14,847 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1596703394, now seen corresponding path program 3 times [2022-04-08 10:06:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999326765] [2022-04-08 10:06:14,852 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:14,853 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1596703394, now seen corresponding path program 4 times [2022-04-08 10:06:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:14,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633064554] [2022-04-08 10:06:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:14,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-08 10:06:14,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-08 10:06:14,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-08 10:06:14,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:14,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-08 10:06:14,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-08 10:06:14,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-08 10:06:14,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-08 10:06:14,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1349#(= main_~y~0 0)} is VALID [2022-04-08 10:06:14,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1349#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:14,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:14,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:14,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1352#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:14,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1352#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:14,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:14,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:14,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:14,975 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-08 10:06:14,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-08 10:06:14,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-08 10:06:14,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-08 10:06:14,976 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-08 10:06:14,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:14,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633064554] [2022-04-08 10:06:14,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633064554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:14,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692880630] [2022-04-08 10:06:14,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:14,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:14,977 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-08 10:06:15,004 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-08 10:06:15,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:15,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:15,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:06:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:15,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:15,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2022-04-08 10:06:15,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-08 10:06:15,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-08 10:06:15,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-08 10:06:15,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-08 10:06:15,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1349#(= main_~y~0 0)} is VALID [2022-04-08 10:06:15,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {1349#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:15,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:15,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:15,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1384#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:15,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1384#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-08 10:06:15,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-08 10:06:15,238 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-08 10:06:15,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:15,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-08 10:06:15,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-08 10:06:15,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-08 10:06:15,335 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-08 10:06:15,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-08 10:06:15,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1430#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:15,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:15,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:15,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {1445#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1441#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:15,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1445#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:15,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-08 10:06:15,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-08 10:06:15,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-08 10:06:15,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-08 10:06:15,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2022-04-08 10:06:15,347 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-08 10:06:15,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692880630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:15,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:15,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 10:06:15,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:15,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999326765] [2022-04-08 10:06:15,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999326765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:15,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:15,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:06:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963873779] [2022-04-08 10:06:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:15,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:15,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,362 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-08 10:06:15,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:06:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:06:15,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:06:15,363 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:15,754 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2022-04-08 10:06:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:06:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 10:06:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 10:06:15,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-08 10:06:15,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:15,820 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:06:15,820 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:06:15,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:15,821 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:15,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 48 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:06:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2022-04-08 10:06:15,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:15,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,865 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,866 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:15,867 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-08 10:06:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-08 10:06:15,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:15,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:15,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:06:15,868 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:06:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:15,870 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-08 10:06:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-08 10:06:15,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:15,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:15,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:15,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-04-08 10:06:15,872 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 18 [2022-04-08 10:06:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:15,873 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-04-08 10:06:15,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-08 10:06:15,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 50 transitions. [2022-04-08 10:06:15,931 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-08 10:06:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-04-08 10:06:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:06:15,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:15,931 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:15,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:16,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-08 10:06:16,132 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-08 10:06:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:16,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825179400] [2022-04-08 10:06:16,136 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:16,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 2 times [2022-04-08 10:06:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836377606] [2022-04-08 10:06:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-08 10:06:16,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-08 10:06:16,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-08 10:06:16,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:16,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-08 10:06:16,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-08 10:06:16,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-08 10:06:16,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-08 10:06:16,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1773#(= main_~y~0 0)} is VALID [2022-04-08 10:06:16,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1773#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1775#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:16,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:16,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:16,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:16,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:16,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:16,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-08 10:06:16,254 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-08 10:06:16,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-08 10:06:16,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-08 10:06:16,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-08 10:06:16,254 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-08 10:06:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:16,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836377606] [2022-04-08 10:06:16,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836377606] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760328056] [2022-04-08 10:06:16,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:16,256 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-08 10:06:16,257 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-08 10:06:16,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:16,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:16,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:06:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:16,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2022-04-08 10:06:16,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-08 10:06:16,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-08 10:06:16,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-08 10:06:16,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-08 10:06:16,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1768#true} is VALID [2022-04-08 10:06:16,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#false} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-08 10:06:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:16,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:16,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-08 10:06:16,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-08 10:06:16,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-08 10:06:16,484 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-08 10:06:16,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#false} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-08 10:06:16,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-08 10:06:16,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:16,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {1768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1768#true} is VALID [2022-04-08 10:06:16,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-08 10:06:16,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-08 10:06:16,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-08 10:06:16,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-08 10:06:16,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2022-04-08 10:06:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:16,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760328056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:16,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:16,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-08 10:06:16,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825179400] [2022-04-08 10:06:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825179400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:16,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:16,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670934] [2022-04-08 10:06:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:16,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,512 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-08 10:06:16,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:06:16,513 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:16,983 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-08 10:06:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:16,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-08 10:06:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-08 10:06:16,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-08 10:06:17,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:17,047 INFO L225 Difference]: With dead ends: 61 [2022-04-08 10:06:17,047 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:06:17,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:06:17,048 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:17,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:06:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-04-08 10:06:17,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:17,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:17,106 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:17,106 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:17,108 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-08 10:06:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-08 10:06:17,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:17,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:17,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 10:06:17,109 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 10:06:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:17,110 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-08 10:06:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-08 10:06:17,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:17,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:17,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:17,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-04-08 10:06:17,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 19 [2022-04-08 10:06:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:17,112 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-04-08 10:06:17,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:17,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 54 transitions. [2022-04-08 10:06:17,174 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-08 10:06:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-04-08 10:06:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:06:17,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:17,175 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:17,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:17,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:17,376 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 399255663, now seen corresponding path program 5 times [2022-04-08 10:06:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:17,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22646405] [2022-04-08 10:06:17,380 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:17,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash 399255663, now seen corresponding path program 6 times [2022-04-08 10:06:17,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:17,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350101663] [2022-04-08 10:06:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:17,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:17,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-08 10:06:17,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-08 10:06:17,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-08 10:06:17,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:17,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-08 10:06:17,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-08 10:06:17,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-08 10:06:17,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-08 10:06:17,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2221#(= main_~y~0 0)} is VALID [2022-04-08 10:06:17,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {2221#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:17,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:17,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:17,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:17,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2225#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:17,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {2225#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,533 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-08 10:06:17,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-08 10:06:17,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-08 10:06:17,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-08 10:06:17,533 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-08 10:06:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:17,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350101663] [2022-04-08 10:06:17,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350101663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:17,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038815656] [2022-04-08 10:06:17,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:17,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:17,535 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-08 10:06:17,543 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-08 10:06:17,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:17,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:17,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:06:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:17,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:17,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2216#true} is VALID [2022-04-08 10:06:17,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-08 10:06:17,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-08 10:06:17,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-08 10:06:17,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-08 10:06:17,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2221#(= main_~y~0 0)} is VALID [2022-04-08 10:06:17,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {2221#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:17,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:17,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:17,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:17,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2260#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2260#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-08 10:06:17,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-08 10:06:17,784 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-08 10:06:17,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:17,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2306#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-08 10:06:17,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {2310#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2306#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:17,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {2310#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2310#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:17,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2317#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2310#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:17,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2321#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2317#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:17,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {2325#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2321#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:17,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2325#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:17,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-08 10:06:17,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-08 10:06:17,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-08 10:06:17,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-08 10:06:17,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2216#true} is VALID [2022-04-08 10:06:17,900 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-08 10:06:17,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038815656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:17,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:17,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 10:06:17,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22646405] [2022-04-08 10:06:17,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22646405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:17,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:17,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931366177] [2022-04-08 10:06:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:17,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:17,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:17,915 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-08 10:06:17,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:06:17,916 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:18,541 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2022-04-08 10:06:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:06:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 10:06:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-08 10:06:18,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-08 10:06:18,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:18,619 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:06:18,619 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:06:18,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:18,620 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:18,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 60 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:06:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-04-08 10:06:18,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:18,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:18,699 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:18,699 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:18,708 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-08 10:06:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-08 10:06:18,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:18,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:18,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 10:06:18,709 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 10:06:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:18,711 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-08 10:06:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-08 10:06:18,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:18,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:18,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:18,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-08 10:06:18,714 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 19 [2022-04-08 10:06:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:18,714 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-08 10:06:18,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-08 10:06:18,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-08 10:06:18,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-08 10:06:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:18,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:18,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:18,807 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-08 10:06:18,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:18,995 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:18,996 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-08 10:06:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:18,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580915095] [2022-04-08 10:06:18,999 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:18,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 2 times [2022-04-08 10:06:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:18,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968785769] [2022-04-08 10:06:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:19,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-08 10:06:19,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-08 10:06:19,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-08 10:06:19,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:19,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-08 10:06:19,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-08 10:06:19,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-08 10:06:19,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-08 10:06:19,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-08 10:06:19,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-08 10:06:19,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,056 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-08 10:06:19,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-08 10:06:19,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-08 10:06:19,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-08 10:06:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:19,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968785769] [2022-04-08 10:06:19,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968785769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:19,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58692194] [2022-04-08 10:06:19,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:19,059 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-08 10:06:19,066 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-08 10:06:19,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:19,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:19,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:06:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:19,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:19,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2768#true} is VALID [2022-04-08 10:06:19,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-08 10:06:19,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-08 10:06:19,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-08 10:06:19,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-08 10:06:19,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-08 10:06:19,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-08 10:06:19,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-08 10:06:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:19,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:19,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-08 10:06:19,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-08 10:06:19,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-08 10:06:19,656 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-08 10:06:19,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-08 10:06:19,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-08 10:06:19,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:06:19,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:19,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-08 10:06:19,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-08 10:06:19,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-08 10:06:19,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-08 10:06:19,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-08 10:06:19,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2768#true} is VALID [2022-04-08 10:06:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:06:19,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58692194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:19,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:19,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:06:19,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:19,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580915095] [2022-04-08 10:06:19,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580915095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:19,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:19,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:06:19,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480950263] [2022-04-08 10:06:19,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:19,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:19,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,688 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-08 10:06:19,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:06:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:06:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:06:19,689 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:19,979 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-08 10:06:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:06:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-08 10:06:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-08 10:06:19,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-08 10:06:20,030 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-08 10:06:20,031 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:06:20,031 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:06:20,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:06:20,032 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:20,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:06:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-08 10:06:20,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:20,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,153 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,154 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:20,156 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-04-08 10:06:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-04-08 10:06:20,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:20,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:20,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:06:20,157 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:06:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:20,158 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-04-08 10:06:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-04-08 10:06:20,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:20,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:20,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:20,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2022-04-08 10:06:20,160 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 20 [2022-04-08 10:06:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:20,160 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-04-08 10:06:20,160 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 78 transitions. [2022-04-08 10:06:20,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2022-04-08 10:06:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:06:20,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:20,265 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:20,290 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-08 10:06:20,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:06:20,466 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1933081666, now seen corresponding path program 7 times [2022-04-08 10:06:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:20,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037524857] [2022-04-08 10:06:20,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:20,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1933081666, now seen corresponding path program 8 times [2022-04-08 10:06:20,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:20,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266503735] [2022-04-08 10:06:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-08 10:06:20,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-08 10:06:20,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-08 10:06:20,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:20,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-08 10:06:20,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-08 10:06:20,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-08 10:06:20,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-08 10:06:20,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#(= main_~y~0 0)} is VALID [2022-04-08 10:06:20,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:20,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:20,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:20,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3301#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:20,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {3301#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,604 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-08 10:06:20,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-08 10:06:20,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-08 10:06:20,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-08 10:06:20,605 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-08 10:06:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:20,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266503735] [2022-04-08 10:06:20,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266503735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:20,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501041569] [2022-04-08 10:06:20,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:20,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:20,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:20,607 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-08 10:06:20,608 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-08 10:06:20,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:20,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:20,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:06:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:20,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:20,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3291#true} is VALID [2022-04-08 10:06:20,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-08 10:06:20,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-08 10:06:20,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-08 10:06:20,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-08 10:06:20,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#(= main_~y~0 0)} is VALID [2022-04-08 10:06:20,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:20,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:20,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:20,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:20,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3339#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:20,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {3339#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-08 10:06:20,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-08 10:06:20,862 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-08 10:06:20,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:21,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:21,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {3385#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-08 10:06:21,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {3389#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3385#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:21,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {3389#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:21,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {3396#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:21,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {3400#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3396#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:21,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {3404#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3400#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:21,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {3408#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3404#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:21,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3408#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:21,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-08 10:06:21,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-08 10:06:21,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-08 10:06:21,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-08 10:06:21,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3291#true} is VALID [2022-04-08 10:06:21,040 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-08 10:06:21,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501041569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:21,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:21,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 10:06:21,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037524857] [2022-04-08 10:06:21,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037524857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:21,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:21,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:06:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86048794] [2022-04-08 10:06:21,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:21,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:21,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:21,058 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-08 10:06:21,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:06:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:06:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:21,059 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:22,034 INFO L93 Difference]: Finished difference Result 118 states and 172 transitions. [2022-04-08 10:06:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:06:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:06:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-08 10:06:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-08 10:06:22,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-08 10:06:22,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:22,121 INFO L225 Difference]: With dead ends: 118 [2022-04-08 10:06:22,121 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 10:06:22,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:06:22,122 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 70 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:22,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 72 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:06:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 10:06:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2022-04-08 10:06:22,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:22,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,262 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,262 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:22,264 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2022-04-08 10:06:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2022-04-08 10:06:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:22,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-08 10:06:22,265 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-08 10:06:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:22,267 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2022-04-08 10:06:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2022-04-08 10:06:22,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:22,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:22,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:22,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-04-08 10:06:22,269 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 20 [2022-04-08 10:06:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:22,270 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-04-08 10:06:22,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:22,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 88 transitions. [2022-04-08 10:06:22,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-04-08 10:06:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:06:22,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:22,388 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:22,411 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-08 10:06:22,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:22,589 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-08 10:06:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500305536] [2022-04-08 10:06:22,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:22,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 2 times [2022-04-08 10:06:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091893491] [2022-04-08 10:06:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:22,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-08 10:06:22,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-08 10:06:22,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-08 10:06:22,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:22,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-08 10:06:22,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-08 10:06:22,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-08 10:06:22,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-08 10:06:22,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:22,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:22,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:06:22,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} ~z~0 := ~y~0; {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:06:22,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:22,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:22,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:22,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:22,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:06:22,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:06:22,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:22,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:22,804 INFO L272 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4019#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:22,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {4019#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4020#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:22,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {4020#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4010#false} is VALID [2022-04-08 10:06:22,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-08 10:06:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091893491] [2022-04-08 10:06:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091893491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474359324] [2022-04-08 10:06:22,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:22,807 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-08 10:06:22,835 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-08 10:06:22,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:22,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:22,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:06:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:22,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:23,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2022-04-08 10:06:23,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-08 10:06:23,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-08 10:06:23,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-08 10:06:23,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-08 10:06:23,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:23,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:23,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:23,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:23,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:23,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:23,038 INFO L272 TraceCheckUtils]: 17: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:23,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4080#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:23,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4010#false} is VALID [2022-04-08 10:06:23,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-08 10:06:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:23,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:23,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-08 10:06:23,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4010#false} is VALID [2022-04-08 10:06:23,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4080#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:23,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:23,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:23,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:23,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} ~z~0 := ~y~0; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:23,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:23,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:23,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-08 10:06:23,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-08 10:06:23,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-08 10:06:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-08 10:06:23,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2022-04-08 10:06:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:06:23,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474359324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:23,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:23,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-08 10:06:23,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:23,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500305536] [2022-04-08 10:06:23,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500305536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:23,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:23,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689559884] [2022-04-08 10:06:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:23,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,313 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-08 10:06:23,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:23,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:23,314 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,726 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-08 10:06:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:06:23,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-08 10:06:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-08 10:06:23,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-04-08 10:06:23,772 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-08 10:06:23,773 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:06:23,773 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:06:23,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:23,774 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:23,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:06:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 10:06:23,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:23,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,874 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,875 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,876 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-08 10:06:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-08 10:06:23,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:23,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:23,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 10:06:23,877 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 10:06:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,878 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-08 10:06:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-08 10:06:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:23,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:23,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:23,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-04-08 10:06:23,881 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 21 [2022-04-08 10:06:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:23,881 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-04-08 10:06:23,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 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-08 10:06:23,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 78 transitions. [2022-04-08 10:06:23,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-08 10:06:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:06:24,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:24,000 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:24,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 10:06:24,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:24,200 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2057919793, now seen corresponding path program 9 times [2022-04-08 10:06:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:24,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629602701] [2022-04-08 10:06:24,205 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:24,205 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2057919793, now seen corresponding path program 10 times [2022-04-08 10:06:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951308812] [2022-04-08 10:06:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-08 10:06:24,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-08 10:06:24,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-08 10:06:24,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:24,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-08 10:06:24,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-08 10:06:24,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-08 10:06:24,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-08 10:06:24,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4549#(= main_~y~0 0)} is VALID [2022-04-08 10:06:24,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {4549#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:24,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:24,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:24,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:24,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4555#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:24,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {4555#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {4545#false} assume !(~y~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {4545#false} assume !(~x~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {4545#false} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-08 10:06:24,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-08 10:06:24,351 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-08 10:06:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:24,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951308812] [2022-04-08 10:06:24,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951308812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:24,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557828344] [2022-04-08 10:06:24,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:24,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:24,354 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-08 10:06:24,355 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-08 10:06:24,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:24,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:24,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:06:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:24,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4544#true} is VALID [2022-04-08 10:06:24,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-08 10:06:24,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-08 10:06:24,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-08 10:06:24,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-08 10:06:24,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4549#(= main_~y~0 0)} is VALID [2022-04-08 10:06:24,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {4549#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:24,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:24,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:24,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:24,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:24,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:24,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:24,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:24,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:24,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,637 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-08 10:06:24,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-08 10:06:24,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-08 10:06:24,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-08 10:06:24,638 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-08 10:06:24,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:24,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-08 10:06:24,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-08 10:06:24,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-08 10:06:24,803 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-08 10:06:24,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-08 10:06:24,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:24,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:24,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:24,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {4646#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:24,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {4646#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:24,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {4653#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:24,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {4657#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4653#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:24,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {4661#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4657#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:24,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {4665#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4661#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:24,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {4669#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4665#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:24,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4669#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:24,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-08 10:06:24,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-08 10:06:24,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-08 10:06:24,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-08 10:06:24,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4544#true} is VALID [2022-04-08 10:06:24,811 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-08 10:06:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557828344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:24,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:24,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:06:24,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:24,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629602701] [2022-04-08 10:06:24,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629602701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:24,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:24,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130704158] [2022-04-08 10:06:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:06:24,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:24,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:24,831 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-08 10:06:24,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:06:24,832 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:25,880 INFO L93 Difference]: Finished difference Result 110 states and 165 transitions. [2022-04-08 10:06:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:06:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:06:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 10:06:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 10:06:25,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-08 10:06:25,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:25,973 INFO L225 Difference]: With dead ends: 110 [2022-04-08 10:06:25,974 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 10:06:25,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:06:25,975 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:25,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 10:06:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2022-04-08 10:06:26,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:26,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,086 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,086 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:26,088 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-08 10:06:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-04-08 10:06:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:26,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:26,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 10:06:26,089 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-08 10:06:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:26,091 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-08 10:06:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-04-08 10:06:26,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:26,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:26,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-04-08 10:06:26,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 21 [2022-04-08 10:06:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:26,094 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-04-08 10:06:26,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 88 transitions. [2022-04-08 10:06:26,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2022-04-08 10:06:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:06:26,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:26,208 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:26,225 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-08 10:06:26,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:06:26,412 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 1 times [2022-04-08 10:06:26,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:26,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038616767] [2022-04-08 10:06:26,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:26,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 2 times [2022-04-08 10:06:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:26,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546238005] [2022-04-08 10:06:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:26,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:26,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-08 10:06:26,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-08 10:06:26,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-08 10:06:26,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:26,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-08 10:06:26,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-08 10:06:26,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-08 10:06:26,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-08 10:06:26,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5243#(= main_~y~0 0)} is VALID [2022-04-08 10:06:26,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:26,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:26,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:26,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5246#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:26,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {5246#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5247#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:26,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {5247#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-08 10:06:26,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-08 10:06:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:26,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546238005] [2022-04-08 10:06:26,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546238005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:26,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818519611] [2022-04-08 10:06:26,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:26,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:26,520 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-08 10:06:26,521 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-08 10:06:26,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:26,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:26,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:06:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:26,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:26,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5238#true} is VALID [2022-04-08 10:06:26,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-08 10:06:26,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-08 10:06:26,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-08 10:06:26,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-08 10:06:26,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5243#(= main_~y~0 0)} is VALID [2022-04-08 10:06:26,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:26,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:26,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:26,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5279#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:26,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {5279#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5283#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {5283#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,702 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-08 10:06:26,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-08 10:06:26,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-08 10:06:26,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-08 10:06:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:26,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:26,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-08 10:06:26,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-08 10:06:26,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {5341#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-08 10:06:26,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {5345#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5341#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:26,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {5349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5345#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:26,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {5353#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {5238#true} ~z~0 := ~y~0; {5353#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {5238#true} assume !(~x~0 % 4294967296 > 0); {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {5238#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {5238#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-08 10:06:26,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5238#true} is VALID [2022-04-08 10:06:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:06:26,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818519611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:26,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:26,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-08 10:06:26,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:26,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038616767] [2022-04-08 10:06:26,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038616767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:26,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:26,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:06:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695513016] [2022-04-08 10:06:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:06:26,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:26,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,847 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-08 10:06:26,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:06:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:06:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:06:26,847 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,343 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2022-04-08 10:06:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:06:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:06:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-08 10:06:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-08 10:06:27,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-08 10:06:27,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:27,392 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:06:27,392 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 10:06:27,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:06:27,393 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:27,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 10:06:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-08 10:06:27,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:27,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,514 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,514 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,515 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-04-08 10:06:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-04-08 10:06:27,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:27,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:27,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-08 10:06:27,516 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-08 10:06:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:27,518 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-04-08 10:06:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-04-08 10:06:27,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:27,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:27,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:27,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2022-04-08 10:06:27,520 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 22 [2022-04-08 10:06:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:27,520 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2022-04-08 10:06:27,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:27,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 87 transitions. [2022-04-08 10:06:27,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2022-04-08 10:06:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:06:27,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:27,624 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:27,640 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-08 10:06:27,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:06:27,825 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash -462225342, now seen corresponding path program 3 times [2022-04-08 10:06:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:27,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908345912] [2022-04-08 10:06:27,828 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:27,828 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -462225342, now seen corresponding path program 4 times [2022-04-08 10:06:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013194889] [2022-04-08 10:06:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:27,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-08 10:06:27,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-08 10:06:27,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5855#(= main_~y~0 0)} is VALID [2022-04-08 10:06:27,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {5855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:27,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {5856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5858#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:27,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {5858#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:27,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:27,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:27,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:27,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:27,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:27,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:27,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-08 10:06:27,960 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-08 10:06:27,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-08 10:06:27,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-08 10:06:27,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-08 10:06:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013194889] [2022-04-08 10:06:27,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013194889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085389525] [2022-04-08 10:06:27,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:27,963 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-08 10:06:27,964 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-08 10:06:28,005 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:28,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:28,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:06:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:28,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:28,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5850#true} is VALID [2022-04-08 10:06:28,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-08 10:06:28,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-08 10:06:28,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-08 10:06:28,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-08 10:06:28,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5850#true} is VALID [2022-04-08 10:06:28,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:28,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:28,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-08 10:06:28,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {5851#false} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-08 10:06:28,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-08 10:06:28,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-08 10:06:28,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-08 10:06:28,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-08 10:06:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:28,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:28,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-08 10:06:28,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-08 10:06:28,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-08 10:06:28,231 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-08 10:06:28,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {5851#false} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-08 10:06:28,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-08 10:06:28,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:28,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:28,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:28,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5850#true} is VALID [2022-04-08 10:06:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085389525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:28,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:28,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-08 10:06:28,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908345912] [2022-04-08 10:06:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908345912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:28,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:28,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619569010] [2022-04-08 10:06:28,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:06:28,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:28,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:28,255 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-08 10:06:28,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:28,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:28,256 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,128 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2022-04-08 10:06:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:06:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:06:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2022-04-08 10:06:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2022-04-08 10:06:29,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 81 transitions. [2022-04-08 10:06:29,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:29,199 INFO L225 Difference]: With dead ends: 98 [2022-04-08 10:06:29,199 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 10:06:29,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:06:29,201 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:29,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 50 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 10:06:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-04-08 10:06:29,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:29,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,356 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,356 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,358 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-08 10:06:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-04-08 10:06:29,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:29,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:29,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-08 10:06:29,359 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-08 10:06:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:29,360 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-08 10:06:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-04-08 10:06:29,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:29,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:29,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:29,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2022-04-08 10:06:29,362 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 22 [2022-04-08 10:06:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:29,362 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2022-04-08 10:06:29,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:29,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 93 transitions. [2022-04-08 10:06:29,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2022-04-08 10:06:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:06:29,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:29,499 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:29,514 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-08 10:06:29,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 10:06:29,699 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1224913438, now seen corresponding path program 11 times [2022-04-08 10:06:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198148819] [2022-04-08 10:06:29,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:29,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1224913438, now seen corresponding path program 12 times [2022-04-08 10:06:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274773239] [2022-04-08 10:06:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-08 10:06:29,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-08 10:06:29,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-08 10:06:29,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:29,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-08 10:06:29,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-08 10:06:29,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-08 10:06:29,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-08 10:06:29,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6542#(= main_~y~0 0)} is VALID [2022-04-08 10:06:29,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:29,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:29,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:29,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:29,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:29,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:29,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:29,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6549#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:29,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {6549#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:29,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:29,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:29,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:29,840 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-08 10:06:29,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-08 10:06:29,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-08 10:06:29,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-08 10:06:29,841 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-08 10:06:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274773239] [2022-04-08 10:06:29,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274773239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134812862] [2022-04-08 10:06:29,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:29,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:29,842 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-08 10:06:29,845 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-08 10:06:29,886 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:06:29,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:29,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:06:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:29,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:30,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6537#true} is VALID [2022-04-08 10:06:30,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-08 10:06:30,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-08 10:06:30,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-08 10:06:30,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-08 10:06:30,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6542#(= main_~y~0 0)} is VALID [2022-04-08 10:06:30,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:30,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:30,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:30,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:30,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:30,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:30,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6593#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {6593#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-08 10:06:30,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-08 10:06:30,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-08 10:06:30,102 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-08 10:06:30,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:30,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {6639#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-08 10:06:30,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {6643#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6639#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:30,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {6643#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6643#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:30,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {6650#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6643#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:30,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {6654#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6650#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:30,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {6658#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6654#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:30,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {6662#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6658#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:30,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {6666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6662#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:30,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {6670#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:30,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6670#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:30,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-08 10:06:30,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-08 10:06:30,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-08 10:06:30,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-08 10:06:30,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6537#true} is VALID [2022-04-08 10:06:30,297 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-08 10:06:30,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134812862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:30,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:30,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:06:30,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:30,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198148819] [2022-04-08 10:06:30,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198148819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:30,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:30,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:06:30,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795487403] [2022-04-08 10:06:30,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:30,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:30,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:30,312 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-08 10:06:30,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:06:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:30,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:06:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:06:30,313 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:31,799 INFO L93 Difference]: Finished difference Result 156 states and 224 transitions. [2022-04-08 10:06:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:31,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-04-08 10:06:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-04-08 10:06:31,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 109 transitions. [2022-04-08 10:06:31,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:31,888 INFO L225 Difference]: With dead ends: 156 [2022-04-08 10:06:31,888 INFO L226 Difference]: Without dead ends: 139 [2022-04-08 10:06:31,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:06:31,889 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:31,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 95 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-08 10:06:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-08 10:06:32,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:32,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,045 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,045 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,047 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-04-08 10:06:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2022-04-08 10:06:32,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-08 10:06:32,048 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-08 10:06:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,050 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-04-08 10:06:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2022-04-08 10:06:32,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:32,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-04-08 10:06:32,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 22 [2022-04-08 10:06:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:32,053 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-04-08 10:06:32,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-08 10:06:32,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 103 transitions. [2022-04-08 10:06:32,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-08 10:06:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:06:32,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:32,187 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:32,203 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-08 10:06:32,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:06:32,388 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1171520209, now seen corresponding path program 13 times [2022-04-08 10:06:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148093213] [2022-04-08 10:06:32,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:32,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1171520209, now seen corresponding path program 14 times [2022-04-08 10:06:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:32,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796715887] [2022-04-08 10:06:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-08 10:06:32,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-08 10:06:32,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-08 10:06:32,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:32,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-08 10:06:32,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-08 10:06:32,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-08 10:06:32,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-08 10:06:32,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7456#(= main_~y~0 0)} is VALID [2022-04-08 10:06:32,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {7456#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:32,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:32,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:32,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:32,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:32,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:32,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:32,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:32,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7464#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:32,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,558 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-08 10:06:32,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-08 10:06:32,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-08 10:06:32,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-08 10:06:32,559 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-08 10:06:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796715887] [2022-04-08 10:06:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796715887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074303843] [2022-04-08 10:06:32,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:32,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:32,561 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-08 10:06:32,586 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-08 10:06:32,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:32,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:32,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:06:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:32,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:32,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7451#true} is VALID [2022-04-08 10:06:32,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-08 10:06:32,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-08 10:06:32,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-08 10:06:32,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-08 10:06:32,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7456#(= main_~y~0 0)} is VALID [2022-04-08 10:06:32,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {7456#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:32,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:32,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:32,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:32,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:32,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:32,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:32,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:32,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7511#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:32,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {7511#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:32,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-08 10:06:32,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-08 10:06:32,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-08 10:06:32,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-08 10:06:32,888 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-08 10:06:32,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:33,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:33,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {7557#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-08 10:06:33,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {7561#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7557#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:33,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {7561#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7561#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:33,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7561#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:33,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {7572#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7568#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:33,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {7576#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7572#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:33,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {7580#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7576#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:33,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7580#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:33,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {7588#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7584#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:33,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {7592#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7588#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:33,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7592#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:33,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-08 10:06:33,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-08 10:06:33,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-08 10:06:33,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-08 10:06:33,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7451#true} is VALID [2022-04-08 10:06:33,135 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-08 10:06:33,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074303843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:33,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:33,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:06:33,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:33,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148093213] [2022-04-08 10:06:33,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148093213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:33,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:33,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:06:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389107521] [2022-04-08 10:06:33,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:33,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:33,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:33,154 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-08 10:06:33,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:06:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:33,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:06:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:06:33,155 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,096 INFO L93 Difference]: Finished difference Result 172 states and 248 transitions. [2022-04-08 10:06:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:06:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-08 10:06:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-08 10:06:35,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2022-04-08 10:06:35,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:35,206 INFO L225 Difference]: With dead ends: 172 [2022-04-08 10:06:35,206 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 10:06:35,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:06:35,207 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:35,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 105 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 10:06:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 84. [2022-04-08 10:06:35,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:35,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,383 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,384 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,387 INFO L93 Difference]: Finished difference Result 155 states and 208 transitions. [2022-04-08 10:06:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2022-04-08 10:06:35,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-08 10:06:35,388 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-08 10:06:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:35,390 INFO L93 Difference]: Finished difference Result 155 states and 208 transitions. [2022-04-08 10:06:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2022-04-08 10:06:35,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:35,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:35,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:35,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-04-08 10:06:35,393 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 23 [2022-04-08 10:06:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:35,393 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-04-08 10:06:35,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-08 10:06:35,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 113 transitions. [2022-04-08 10:06:35,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-04-08 10:06:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:06:35,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:35,542 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:35,559 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-08 10:06:35,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:06:35,747 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 3 times [2022-04-08 10:06:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:35,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452224155] [2022-04-08 10:06:35,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:35,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 4 times [2022-04-08 10:06:35,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:35,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555973359] [2022-04-08 10:06:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-08 10:06:35,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-08 10:06:35,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-08 10:06:35,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:35,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-08 10:06:35,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-08 10:06:35,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-08 10:06:35,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-08 10:06:35,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-08 10:06:35,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:35,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:35,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:35,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:06:35,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8460#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:06:35,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {8460#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:35,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:35,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:35,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:35,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:06:35,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:35,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:35,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:35,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:35,832 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-08 10:06:35,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-08 10:06:35,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-08 10:06:35,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-08 10:06:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555973359] [2022-04-08 10:06:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555973359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440701959] [2022-04-08 10:06:35,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:35,835 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-08 10:06:35,863 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-08 10:06:35,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:35,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:35,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:06:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:36,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8453#true} is VALID [2022-04-08 10:06:36,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-08 10:06:36,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-08 10:06:36,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-08 10:06:36,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-08 10:06:36,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-08 10:06:36,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:36,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:36,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-08 10:06:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:36,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:36,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:36,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-08 10:06:36,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-08 10:06:36,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:06:36,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:36,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:06:36,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:36,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-08 10:06:36,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-08 10:06:36,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-08 10:06:36,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-08 10:06:36,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-08 10:06:36,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8453#true} is VALID [2022-04-08 10:06:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:36,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440701959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:36,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:36,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-08 10:06:36,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:36,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452224155] [2022-04-08 10:06:36,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452224155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:36,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:36,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:06:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264308802] [2022-04-08 10:06:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:06:36,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:36,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,291 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-08 10:06:36,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:06:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:06:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:06:36,293 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:36,907 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2022-04-08 10:06:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:06:36,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:06:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 10:06:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 10:06:36,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-08 10:06:36,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:36,978 INFO L225 Difference]: With dead ends: 126 [2022-04-08 10:06:36,978 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 10:06:36,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:06:36,979 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:36,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 38 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:06:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 10:06:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2022-04-08 10:06:37,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:37,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,242 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,242 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:37,244 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2022-04-08 10:06:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2022-04-08 10:06:37,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:37,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:37,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-08 10:06:37,245 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-08 10:06:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:37,247 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2022-04-08 10:06:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2022-04-08 10:06:37,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:37,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:37,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:37,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2022-04-08 10:06:37,250 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 24 [2022-04-08 10:06:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:37,250 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2022-04-08 10:06:37,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:37,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 141 transitions. [2022-04-08 10:06:37,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2022-04-08 10:06:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:06:37,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:37,467 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:37,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 10:06:37,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:06:37,671 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -495266734, now seen corresponding path program 3 times [2022-04-08 10:06:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:37,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055410549] [2022-04-08 10:06:37,675 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:37,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -495266734, now seen corresponding path program 4 times [2022-04-08 10:06:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:37,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77365335] [2022-04-08 10:06:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-08 10:06:37,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-08 10:06:37,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-08 10:06:37,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:37,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-08 10:06:37,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-08 10:06:37,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-08 10:06:37,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-08 10:06:37,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9315#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:37,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:37,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:37,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9319#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {9319#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9320#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-08 10:06:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:06:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:37,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77365335] [2022-04-08 10:06:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77365335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:37,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174741320] [2022-04-08 10:06:37,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:37,785 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-08 10:06:37,807 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-08 10:06:37,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:37,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:37,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:06:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:37,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:37,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9310#true} is VALID [2022-04-08 10:06:37,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-08 10:06:37,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-08 10:06:37,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-08 10:06:37,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-08 10:06:37,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9315#(= main_~y~0 0)} is VALID [2022-04-08 10:06:37,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:37,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:37,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:37,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:37,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9355#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:37,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {9355#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9359#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:37,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {9359#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-08 10:06:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:06:37,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:38,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:38,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {9423#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-08 10:06:38,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {9427#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9423#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:38,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {9431#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9427#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:38,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {9435#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9431#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {9310#true} ~z~0 := ~y~0; {9435#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {9310#true} assume !(~x~0 % 4294967296 > 0); {9310#true} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-08 10:06:38,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9310#true} is VALID [2022-04-08 10:06:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 10:06:38,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174741320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:38,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:38,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-08 10:06:38,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:38,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055410549] [2022-04-08 10:06:38,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055410549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:38,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:38,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:06:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11884636] [2022-04-08 10:06:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:06:38,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:38,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,108 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-08 10:06:38,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:06:38,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:38,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:06:38,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:06:38,108 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,085 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2022-04-08 10:06:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:06:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:06:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-04-08 10:06:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-04-08 10:06:39,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2022-04-08 10:06:39,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:39,164 INFO L225 Difference]: With dead ends: 146 [2022-04-08 10:06:39,164 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 10:06:39,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:06:39,165 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:39,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 58 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 10:06:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2022-04-08 10:06:39,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:39,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,449 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,449 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,451 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-04-08 10:06:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-04-08 10:06:39,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-08 10:06:39,452 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-08 10:06:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:39,454 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-04-08 10:06:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-04-08 10:06:39,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:39,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:39,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:39,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2022-04-08 10:06:39,465 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 24 [2022-04-08 10:06:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:39,465 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2022-04-08 10:06:39,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:39,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 140 transitions. [2022-04-08 10:06:39,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2022-04-08 10:06:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:06:39,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:39,709 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:39,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:39,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:39,910 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash 483669890, now seen corresponding path program 15 times [2022-04-08 10:06:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:39,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422665440] [2022-04-08 10:06:39,912 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:39,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash 483669890, now seen corresponding path program 16 times [2022-04-08 10:06:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603812754] [2022-04-08 10:06:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-08 10:06:40,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-08 10:06:40,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-08 10:06:40,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:40,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-08 10:06:40,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-08 10:06:40,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-08 10:06:40,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-08 10:06:40,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10258#(= main_~y~0 0)} is VALID [2022-04-08 10:06:40,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {10258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:40,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:40,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:40,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:40,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:40,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:40,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:40,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {10267#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:40,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {10267#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,078 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-08 10:06:40,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-08 10:06:40,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-08 10:06:40,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-08 10:06:40,078 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-08 10:06:40,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:40,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603812754] [2022-04-08 10:06:40,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603812754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:40,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584573316] [2022-04-08 10:06:40,078 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:40,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:40,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:40,079 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-08 10:06:40,080 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-08 10:06:40,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:40,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:40,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:06:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:40,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10253#true} is VALID [2022-04-08 10:06:40,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-08 10:06:40,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-08 10:06:40,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-08 10:06:40,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-08 10:06:40,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10258#(= main_~y~0 0)} is VALID [2022-04-08 10:06:40,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {10258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:40,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:40,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:40,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:40,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:40,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:40,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:40,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {10317#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {10317#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,370 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-08 10:06:40,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-08 10:06:40,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-08 10:06:40,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-08 10:06:40,371 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-08 10:06:40,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:40,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-08 10:06:40,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-08 10:06:40,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-08 10:06:40,608 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-08 10:06:40,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {10363#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-08 10:06:40,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {10367#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {10363#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:40,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {10367#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:40,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {10374#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:40,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {10378#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10374#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:40,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {10382#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10378#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:40,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {10386#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10382#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:40,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {10390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10386#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:40,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {10394#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:40,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {10398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10394#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:40,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {10402#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:40,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10402#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:40,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-08 10:06:40,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-08 10:06:40,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-08 10:06:40,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-08 10:06:40,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10253#true} is VALID [2022-04-08 10:06:40,624 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-08 10:06:40,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584573316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:40,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:40,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:06:40,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:40,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422665440] [2022-04-08 10:06:40,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422665440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:40,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:40,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:06:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277170081] [2022-04-08 10:06:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:40,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:40,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:40,643 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-08 10:06:40,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:06:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:06:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:06:40,644 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:42,994 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2022-04-08 10:06:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:06:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-08 10:06:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-08 10:06:42,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-08 10:06:43,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:43,109 INFO L225 Difference]: With dead ends: 215 [2022-04-08 10:06:43,109 INFO L226 Difference]: Without dead ends: 195 [2022-04-08 10:06:43,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:06:43,110 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 108 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:43,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 117 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:06:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-08 10:06:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2022-04-08 10:06:43,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:43,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,444 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,444 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,448 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2022-04-08 10:06:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 260 transitions. [2022-04-08 10:06:43,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 195 states. [2022-04-08 10:06:43,449 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 195 states. [2022-04-08 10:06:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,452 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2022-04-08 10:06:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 260 transitions. [2022-04-08 10:06:43,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:43,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2022-04-08 10:06:43,456 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 24 [2022-04-08 10:06:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:43,456 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions. [2022-04-08 10:06:43,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-08 10:06:43,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 153 transitions. [2022-04-08 10:06:43,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions. [2022-04-08 10:06:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:06:43,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:43,736 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:43,762 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-08 10:06:43,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:43,937 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1115860192, now seen corresponding path program 5 times [2022-04-08 10:06:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:43,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474982839] [2022-04-08 10:06:43,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:43,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1115860192, now seen corresponding path program 6 times [2022-04-08 10:06:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:43,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513873946] [2022-04-08 10:06:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-08 10:06:44,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-08 10:06:44,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-08 10:06:44,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:44,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-08 10:06:44,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-08 10:06:44,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-08 10:06:44,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-08 10:06:44,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11494#(= main_~y~0 0)} is VALID [2022-04-08 10:06:44,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {11494#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11495#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:44,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {11495#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11496#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:44,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {11496#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:44,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:44,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {11498#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:44,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {11498#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:44,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:44,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:44,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:44,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:44,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:44,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:44,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:44,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:44,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-08 10:06:44,117 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-08 10:06:44,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-08 10:06:44,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-08 10:06:44,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-08 10:06:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513873946] [2022-04-08 10:06:44,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513873946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202838703] [2022-04-08 10:06:44,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:44,119 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-08 10:06:44,121 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-08 10:06:44,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:44,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:44,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:06:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:44,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:44,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2022-04-08 10:06:44,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-08 10:06:44,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-08 10:06:44,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-08 10:06:44,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-08 10:06:44,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11489#true} is VALID [2022-04-08 10:06:44,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {11489#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:44,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:44,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:44,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:44,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {11490#false} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-08 10:06:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:44,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:44,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-08 10:06:44,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-08 10:06:44,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-08 10:06:44,431 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-08 10:06:44,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {11490#false} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-08 10:06:44,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-08 10:06:44,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:44,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:44,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:44,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:06:44,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:44,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {11489#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:44,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2022-04-08 10:06:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:06:44,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202838703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:44,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:44,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-08 10:06:44,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:44,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474982839] [2022-04-08 10:06:44,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474982839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:44,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:44,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:06:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123237458] [2022-04-08 10:06:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:06:44,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:44,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:44,465 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-08 10:06:44,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:06:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:06:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:44,465 INFO L87 Difference]: Start difference. First operand 113 states and 153 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:46,351 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2022-04-08 10:06:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:06:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:06:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-08 10:06:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-08 10:06:46,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2022-04-08 10:06:46,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:46,485 INFO L225 Difference]: With dead ends: 174 [2022-04-08 10:06:46,485 INFO L226 Difference]: Without dead ends: 156 [2022-04-08 10:06:46,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:06:46,486 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:46,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 70 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-08 10:06:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2022-04-08 10:06:46,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:46,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,843 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,843 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:46,845 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2022-04-08 10:06:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-08 10:06:46,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:46,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:46,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-08 10:06:46,846 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-08 10:06:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:46,849 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2022-04-08 10:06:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-08 10:06:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:46,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:46,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:46,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2022-04-08 10:06:46,852 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 25 [2022-04-08 10:06:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:46,852 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2022-04-08 10:06:46,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:46,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 158 transitions. [2022-04-08 10:06:47,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2022-04-08 10:06:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:06:47,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:47,085 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:47,101 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-08 10:06:47,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:47,285 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash 254955407, now seen corresponding path program 17 times [2022-04-08 10:06:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [360400236] [2022-04-08 10:06:47,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:47,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 254955407, now seen corresponding path program 18 times [2022-04-08 10:06:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027560739] [2022-04-08 10:06:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-08 10:06:47,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-08 10:06:47,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-08 10:06:47,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:47,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-08 10:06:47,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-08 10:06:47,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-08 10:06:47,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-08 10:06:47,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12608#(= main_~y~0 0)} is VALID [2022-04-08 10:06:47,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {12608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:47,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:47,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:47,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:47,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:47,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:47,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:47,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:47,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:47,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12618#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:47,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {12618#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,487 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-08 10:06:47,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-08 10:06:47,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-08 10:06:47,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-08 10:06:47,487 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-08 10:06:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:47,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027560739] [2022-04-08 10:06:47,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027560739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79299214] [2022-04-08 10:06:47,488 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:47,491 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-08 10:06:47,493 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-08 10:06:47,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:06:47,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:47,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:06:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:47,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2022-04-08 10:06:47,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-08 10:06:47,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-08 10:06:47,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-08 10:06:47,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-08 10:06:47,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12608#(= main_~y~0 0)} is VALID [2022-04-08 10:06:47,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {12608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:47,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:47,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:47,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:47,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:47,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:47,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:47,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:47,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:47,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12671#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {12671#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-08 10:06:47,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-08 10:06:47,791 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-08 10:06:47,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:48,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:48,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {12717#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-08 10:06:48,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {12721#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {12717#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:48,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {12721#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:48,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {12728#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:48,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {12732#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12728#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:48,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {12736#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12732#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:48,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {12740#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12736#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:48,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {12744#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12740#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:48,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {12748#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12744#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:48,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {12752#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12748#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:48,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {12756#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12752#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:48,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {12760#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12756#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:48,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12760#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:48,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-08 10:06:48,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-08 10:06:48,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-08 10:06:48,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-08 10:06:48,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2022-04-08 10:06:48,066 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-08 10:06:48,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79299214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:48,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:48,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:06:48,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:48,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [360400236] [2022-04-08 10:06:48,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [360400236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:48,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:48,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:06:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160298383] [2022-04-08 10:06:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:48,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:48,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:48,082 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-08 10:06:48,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:06:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:06:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:06:48,083 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:51,330 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2022-04-08 10:06:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:06:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2022-04-08 10:06:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2022-04-08 10:06:51,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 145 transitions. [2022-04-08 10:06:51,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:51,474 INFO L225 Difference]: With dead ends: 266 [2022-04-08 10:06:51,474 INFO L226 Difference]: Without dead ends: 246 [2022-04-08 10:06:51,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:06:51,475 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:51,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 129 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:06:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-08 10:06:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 128. [2022-04-08 10:06:51,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:51,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:51,911 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:51,911 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:51,917 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2022-04-08 10:06:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-08 10:06:51,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:51,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:51,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-08 10:06:51,918 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-08 10:06:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:51,925 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2022-04-08 10:06:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-08 10:06:51,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:51,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:51,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:51,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-04-08 10:06:51,930 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 25 [2022-04-08 10:06:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:51,930 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-04-08 10:06:51,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-08 10:06:51,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 171 transitions. [2022-04-08 10:06:52,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-04-08 10:06:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:52,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:52,279 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:52,303 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-08 10:06:52,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:52,480 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 3 times [2022-04-08 10:06:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:52,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115348205] [2022-04-08 10:06:52,482 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:52,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 4 times [2022-04-08 10:06:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:52,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433793939] [2022-04-08 10:06:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:52,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:52,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-08 10:06:52,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-08 10:06:52,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14089#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-08 10:06:52,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {14089#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:52,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:52,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:52,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:06:52,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:06:52,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:06:52,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:06:52,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~y~0 % 4294967296 > 0); {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:06:52,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:52,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:52,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:52,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:06:52,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:52,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:52,768 INFO L272 TraceCheckUtils]: 22: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14095#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:52,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {14095#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14096#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:52,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {14096#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14084#false} is VALID [2022-04-08 10:06:52,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-08 10:06:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:52,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:52,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433793939] [2022-04-08 10:06:52,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433793939] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:52,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20070873] [2022-04-08 10:06:52,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:52,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:52,771 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-08 10:06:52,772 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-08 10:06:52,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:52,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:52,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:06:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:52,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:52,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14083#true} is VALID [2022-04-08 10:06:52,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-08 10:06:52,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-08 10:06:52,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-08 10:06:52,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-08 10:06:52,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:06:52,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:06:52,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:06:52,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:52,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:06:52,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:52,987 INFO L272 TraceCheckUtils]: 22: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:52,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:52,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {14172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14084#false} is VALID [2022-04-08 10:06:52,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-08 10:06:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:52,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:53,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-08 10:06:53,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {14172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14084#false} is VALID [2022-04-08 10:06:53,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:53,281 INFO L272 TraceCheckUtils]: 22: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:53,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} ~z~0 := ~y~0; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:53,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:53,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-08 10:06:53,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-08 10:06:53,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-08 10:06:53,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-08 10:06:53,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14083#true} is VALID [2022-04-08 10:06:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:06:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20070873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:53,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:53,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-04-08 10:06:53,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:53,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115348205] [2022-04-08 10:06:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115348205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:53,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:53,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:06:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143135528] [2022-04-08 10:06:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:53,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:06:53,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:53,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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-08 10:06:53,317 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-08 10:06:53,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:06:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:06:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:06:53,318 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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-08 10:06:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,172 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2022-04-08 10:06:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:06:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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-08 10:06:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-08 10:06:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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-08 10:06:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-08 10:06:54,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-08 10:06:54,226 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-08 10:06:54,227 INFO L225 Difference]: With dead ends: 143 [2022-04-08 10:06:54,227 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 10:06:54,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:06:54,228 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:54,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:06:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 10:06:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 10:06:54,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:54,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,610 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,611 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,613 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-08 10:06:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-08 10:06:54,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:54,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:54,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-08 10:06:54,614 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-08 10:06:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:54,615 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-08 10:06:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-08 10:06:54,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:54,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:54,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:54,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2022-04-08 10:06:54,618 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 159 transitions. Word has length 26 [2022-04-08 10:06:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:54,618 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 159 transitions. [2022-04-08 10:06:54,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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-08 10:06:54,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 159 transitions. [2022-04-08 10:06:54,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-08 10:06:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:54,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:54,857 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:54,873 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-08 10:06:55,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:55,059 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash -32897246, now seen corresponding path program 5 times [2022-04-08 10:06:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248459993] [2022-04-08 10:06:55,068 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:55,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash -32897246, now seen corresponding path program 6 times [2022-04-08 10:06:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:55,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815706029] [2022-04-08 10:06:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-08 10:06:55,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-08 10:06:55,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-08 10:06:55,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:55,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-08 10:06:55,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-08 10:06:55,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-08 10:06:55,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-08 10:06:55,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15037#(= main_~y~0 0)} is VALID [2022-04-08 10:06:55,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {15037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:55,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:55,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:55,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:55,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15042#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:55,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {15042#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15043#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:55,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {15043#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-08 10:06:55,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-08 10:06:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:06:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815706029] [2022-04-08 10:06:55,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815706029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596485516] [2022-04-08 10:06:55,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:55,204 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-08 10:06:55,243 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-08 10:06:55,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:06:55,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:55,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:06:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:55,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15032#true} is VALID [2022-04-08 10:06:55,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-08 10:06:55,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-08 10:06:55,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-08 10:06:55,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-08 10:06:55,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15037#(= main_~y~0 0)} is VALID [2022-04-08 10:06:55,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {15037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:55,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:55,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:55,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:55,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:55,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15081#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:55,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {15081#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15085#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:55,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {15085#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-08 10:06:55,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-08 10:06:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:06:55,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-08 10:06:55,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-08 10:06:55,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {15155#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-08 10:06:55,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {15159#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15155#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:06:55,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {15163#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {15159#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:06:55,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {15167#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15163#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:55,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {15032#true} ~z~0 := ~y~0; {15167#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:06:55,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {15032#true} assume !(~x~0 % 4294967296 > 0); {15032#true} is VALID [2022-04-08 10:06:55,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-08 10:06:55,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15032#true} is VALID [2022-04-08 10:06:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 10:06:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596485516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:55,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-08 10:06:55,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:55,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248459993] [2022-04-08 10:06:55,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248459993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:55,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:06:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268476087] [2022-04-08 10:06:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:06:55,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:55,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:55,597 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-08 10:06:55,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:06:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:06:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:06:55,597 INFO L87 Difference]: Start difference. First operand 118 states and 159 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:56,971 INFO L93 Difference]: Finished difference Result 183 states and 240 transitions. [2022-04-08 10:06:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:06:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:06:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-08 10:06:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-08 10:06:56,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-08 10:06:57,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:57,033 INFO L225 Difference]: With dead ends: 183 [2022-04-08 10:06:57,034 INFO L226 Difference]: Without dead ends: 170 [2022-04-08 10:06:57,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:06:57,034 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:57,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 72 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:06:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-08 10:06:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2022-04-08 10:06:57,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:57,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:57,337 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:57,338 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:57,339 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2022-04-08 10:06:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-08 10:06:57,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:57,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:57,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 10:06:57,340 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 10:06:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:57,342 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2022-04-08 10:06:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-08 10:06:57,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:57,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:57,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:57,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2022-04-08 10:06:57,345 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 158 transitions. Word has length 26 [2022-04-08 10:06:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:57,345 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 158 transitions. [2022-04-08 10:06:57,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:57,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 158 transitions. [2022-04-08 10:06:57,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 158 transitions. [2022-04-08 10:06:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:06:57,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:57,586 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:57,602 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-08 10:06:57,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:57,787 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1754741026, now seen corresponding path program 19 times [2022-04-08 10:06:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:57,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946178948] [2022-04-08 10:06:57,790 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:57,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1754741026, now seen corresponding path program 20 times [2022-04-08 10:06:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:57,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781539014] [2022-04-08 10:06:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:57,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-08 10:06:57,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-08 10:06:57,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-08 10:06:57,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:57,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-08 10:06:57,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-08 10:06:57,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-08 10:06:57,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-08 10:06:57,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16169#(= main_~y~0 0)} is VALID [2022-04-08 10:06:57,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {16169#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:57,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:57,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:57,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:57,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:57,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:57,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:57,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:57,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:57,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:57,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:57,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16180#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:57,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-08 10:06:57,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-08 10:06:57,988 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-08 10:06:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781539014] [2022-04-08 10:06:57,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781539014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634715092] [2022-04-08 10:06:57,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:57,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:57,990 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-08 10:06:57,991 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-08 10:06:58,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:58,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:58,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:06:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:58,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:58,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16164#true} is VALID [2022-04-08 10:06:58,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-08 10:06:58,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-08 10:06:58,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-08 10:06:58,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-08 10:06:58,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16169#(= main_~y~0 0)} is VALID [2022-04-08 10:06:58,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {16169#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:58,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:58,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:58,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:58,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:58,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:58,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:58,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:58,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:58,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:58,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:58,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16236#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:58,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {16236#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-08 10:06:58,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-08 10:06:58,307 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-08 10:06:58,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {16282#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-08 10:06:58,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {16286#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16282#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:58,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {16286#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:58,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {16293#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:58,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {16297#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16293#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:58,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {16301#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16297#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:58,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {16305#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16301#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:58,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {16309#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16305#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:58,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {16313#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16309#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:58,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {16317#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16313#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:58,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {16321#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16317#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:58,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {16325#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16321#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:58,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {16329#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16325#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:58,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16329#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:58,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-08 10:06:58,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-08 10:06:58,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-08 10:06:58,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-08 10:06:58,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16164#true} is VALID [2022-04-08 10:06:58,615 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-08 10:06:58,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634715092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:58,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:58,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:06:58,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:58,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946178948] [2022-04-08 10:06:58,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946178948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:58,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:58,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:06:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318340757] [2022-04-08 10:06:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:06:58,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:58,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:06:58,635 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-08 10:06:58,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:06:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:06:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:06:58,636 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:07:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,067 INFO L93 Difference]: Finished difference Result 268 states and 386 transitions. [2022-04-08 10:07:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:07:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:07:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2022-04-08 10:07:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:07:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2022-04-08 10:07:02,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 153 transitions. [2022-04-08 10:07:02,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:02,198 INFO L225 Difference]: With dead ends: 268 [2022-04-08 10:07:02,198 INFO L226 Difference]: Without dead ends: 248 [2022-04-08 10:07:02,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:07:02,199 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:02,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 138 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:07:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-08 10:07:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 127. [2022-04-08 10:07:02,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:02,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:02,523 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:02,523 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,527 INFO L93 Difference]: Finished difference Result 248 states and 325 transitions. [2022-04-08 10:07:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2022-04-08 10:07:02,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:02,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:02,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-08 10:07:02,528 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-08 10:07:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,532 INFO L93 Difference]: Finished difference Result 248 states and 325 transitions. [2022-04-08 10:07:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2022-04-08 10:07:02,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:02,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:02,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:02,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2022-04-08 10:07:02,534 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 26 [2022-04-08 10:07:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:02,534 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2022-04-08 10:07:02,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-08 10:07:02,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 171 transitions. [2022-04-08 10:07:02,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2022-04-08 10:07:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:07:02,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:02,800 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:02,825 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-08 10:07:03,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 10:07:03,022 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 992117264, now seen corresponding path program 7 times [2022-04-08 10:07:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:03,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347935860] [2022-04-08 10:07:03,025 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:03,025 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 992117264, now seen corresponding path program 8 times [2022-04-08 10:07:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665549319] [2022-04-08 10:07:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-08 10:07:03,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-08 10:07:03,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-08 10:07:03,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:03,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-08 10:07:03,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-08 10:07:03,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-08 10:07:03,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-08 10:07:03,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17665#(= main_~y~0 0)} is VALID [2022-04-08 10:07:03,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {17665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:03,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {17666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:03,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {17667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:03,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {17668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:03,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:03,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {17670#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:03,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {17670#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17671#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:03,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {17671#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17672#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:03,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {17672#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:03,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {17673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {17661#false} assume !(~y~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {17661#false} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-08 10:07:03,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-08 10:07:03,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-08 10:07:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:07:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665549319] [2022-04-08 10:07:03,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665549319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447695132] [2022-04-08 10:07:03,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:03,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:03,188 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-08 10:07:03,215 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-08 10:07:03,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:03,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:03,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:07:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:03,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:03,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17660#true} is VALID [2022-04-08 10:07:03,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-08 10:07:03,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-08 10:07:03,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-08 10:07:03,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-08 10:07:03,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17660#true} is VALID [2022-04-08 10:07:03,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17660#true} is VALID [2022-04-08 10:07:03,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:03,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:03,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:03,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:03,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,372 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-08 10:07:03,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-08 10:07:03,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-08 10:07:03,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-08 10:07:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:07:03,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:03,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-08 10:07:03,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-08 10:07:03,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-08 10:07:03,457 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-08 10:07:03,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-08 10:07:03,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:03,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:03,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:03,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:03,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:03,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:03,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17660#true} is VALID [2022-04-08 10:07:03,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17660#true} is VALID [2022-04-08 10:07:03,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-08 10:07:03,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-08 10:07:03,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-08 10:07:03,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-08 10:07:03,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17660#true} is VALID [2022-04-08 10:07:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:07:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447695132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:03,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:03,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-08 10:07:03,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347935860] [2022-04-08 10:07:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347935860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:03,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:03,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992420926] [2022-04-08 10:07:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:07:03,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:03,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-08 10:07:03,481 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-08 10:07:03,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:07:03,481 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-08 10:07:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:05,009 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2022-04-08 10:07:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:07:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-08 10:07:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-08 10:07:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-08 10:07:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-08 10:07:05,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2022-04-08 10:07:05,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:05,078 INFO L225 Difference]: With dead ends: 192 [2022-04-08 10:07:05,078 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 10:07:05,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:05,080 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:05,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 10:07:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2022-04-08 10:07:05,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:05,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:05,396 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:05,397 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:05,399 INFO L93 Difference]: Finished difference Result 173 states and 231 transitions. [2022-04-08 10:07:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2022-04-08 10:07:05,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:05,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:05,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 10:07:05,400 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 10:07:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:05,402 INFO L93 Difference]: Finished difference Result 173 states and 231 transitions. [2022-04-08 10:07:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2022-04-08 10:07:05,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:05,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:05,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:05,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-04-08 10:07:05,405 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 27 [2022-04-08 10:07:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:05,405 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-04-08 10:07:05,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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-08 10:07:05,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 171 transitions. [2022-04-08 10:07:05,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-04-08 10:07:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:07:05,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:05,670 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:05,686 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-08 10:07:05,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 10:07:05,871 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1003454959, now seen corresponding path program 21 times [2022-04-08 10:07:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:05,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592720754] [2022-04-08 10:07:05,891 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:05,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1003454959, now seen corresponding path program 22 times [2022-04-08 10:07:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:05,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881201254] [2022-04-08 10:07:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:06,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-08 10:07:06,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-08 10:07:06,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-08 10:07:06,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:06,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-08 10:07:06,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-08 10:07:06,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-08 10:07:06,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-08 10:07:06,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18855#(= main_~y~0 0)} is VALID [2022-04-08 10:07:06,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:06,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:06,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:06,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:06,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:06,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:06,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:06,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:06,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:06,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:06,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:06,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:06,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {18867#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {18867#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-08 10:07:06,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-08 10:07:06,138 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-08 10:07:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:06,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881201254] [2022-04-08 10:07:06,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881201254] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:06,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751173246] [2022-04-08 10:07:06,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:06,140 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-08 10:07:06,141 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-08 10:07:06,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:06,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:06,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:07:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:06,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:06,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18850#true} is VALID [2022-04-08 10:07:06,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-08 10:07:06,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-08 10:07:06,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-08 10:07:06,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-08 10:07:06,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18855#(= main_~y~0 0)} is VALID [2022-04-08 10:07:06,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:06,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:06,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:06,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:06,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:06,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:06,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:06,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:06,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:06,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:06,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:06,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:06,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {18926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {18926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-08 10:07:06,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-08 10:07:06,433 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-08 10:07:06,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:06,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {18972#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-08 10:07:06,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {18976#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {18972#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:06,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {18976#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18976#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:06,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {18983#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18976#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:06,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {18987#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:06,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {18991#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18987#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:06,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {18995#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18991#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:06,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {18999#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18995#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:06,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {19003#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18999#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:06,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {19007#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19003#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:06,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {19011#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19007#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:06,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {19015#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19011#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:06,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {19019#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19015#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:06,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {19023#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19019#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:06,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19023#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:06,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-08 10:07:06,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-08 10:07:06,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-08 10:07:06,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-08 10:07:06,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18850#true} is VALID [2022-04-08 10:07:06,775 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-08 10:07:06,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751173246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:06,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:06,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:07:06,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:06,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592720754] [2022-04-08 10:07:06,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592720754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:06,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:06,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:07:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279169312] [2022-04-08 10:07:06,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:06,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:06,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:06,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:06,792 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-08 10:07:06,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:07:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:06,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:07:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:07:06,793 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:10,769 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2022-04-08 10:07:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:07:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2022-04-08 10:07:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2022-04-08 10:07:10,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 165 transitions. [2022-04-08 10:07:10,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:10,918 INFO L225 Difference]: With dead ends: 289 [2022-04-08 10:07:10,918 INFO L226 Difference]: Without dead ends: 269 [2022-04-08 10:07:10,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:07:10,919 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 135 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:10,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 150 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:07:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-08 10:07:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 137. [2022-04-08 10:07:11,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:11,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,272 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,272 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:11,275 INFO L93 Difference]: Finished difference Result 269 states and 352 transitions. [2022-04-08 10:07:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2022-04-08 10:07:11,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:11,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:11,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-08 10:07:11,276 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-08 10:07:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:11,280 INFO L93 Difference]: Finished difference Result 269 states and 352 transitions. [2022-04-08 10:07:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2022-04-08 10:07:11,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:11,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:11,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:11,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-04-08 10:07:11,283 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 27 [2022-04-08 10:07:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:11,283 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-04-08 10:07:11,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 10:07:11,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 184 transitions. [2022-04-08 10:07:11,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-04-08 10:07:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:11,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:11,592 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:11,608 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-08 10:07:11,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:07:11,792 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 5 times [2022-04-08 10:07:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:11,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252910236] [2022-04-08 10:07:11,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:11,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 6 times [2022-04-08 10:07:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:11,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665968583] [2022-04-08 10:07:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:11,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-08 10:07:11,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-08 10:07:11,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-08 10:07:11,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:11,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-08 10:07:11,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-08 10:07:11,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-08 10:07:11,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-08 10:07:11,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-08 10:07:11,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:11,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20466#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:07:11,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {20466#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:11,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:11,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:11,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20468#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:07:11,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {20468#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20469#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:11,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {20469#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:11,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-08 10:07:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:11,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665968583] [2022-04-08 10:07:11,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665968583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:11,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186145369] [2022-04-08 10:07:11,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:11,934 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-08 10:07:11,935 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-08 10:07:11,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:11,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:11,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:07:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:11,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:12,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20460#true} is VALID [2022-04-08 10:07:12,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-08 10:07:12,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-08 10:07:12,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-08 10:07:12,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-08 10:07:12,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-08 10:07:12,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:12,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:12,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:12,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:12,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-08 10:07:12,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-08 10:07:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:12,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:12,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-08 10:07:12,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-08 10:07:12,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-08 10:07:12,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:12,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:12,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:12,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:12,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:12,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20460#true} is VALID [2022-04-08 10:07:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:07:12,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186145369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:12,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:12,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-08 10:07:12,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252910236] [2022-04-08 10:07:12,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252910236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:12,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:12,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862555256] [2022-04-08 10:07:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:07:12,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:12,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:12,393 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-08 10:07:12,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:12,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:12,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:07:12,394 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:13,493 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2022-04-08 10:07:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:07:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:07:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 10:07:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 10:07:13,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-08 10:07:13,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:13,561 INFO L225 Difference]: With dead ends: 193 [2022-04-08 10:07:13,561 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 10:07:13,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:07:13,562 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:13,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:07:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 10:07:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 164. [2022-04-08 10:07:14,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:14,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,070 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,070 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,072 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-08 10:07:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-04-08 10:07:14,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:14,073 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-08 10:07:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,075 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-08 10:07:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-04-08 10:07:14,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:14,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 221 transitions. [2022-04-08 10:07:14,079 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 221 transitions. Word has length 28 [2022-04-08 10:07:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:14,079 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 221 transitions. [2022-04-08 10:07:14,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:14,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 221 transitions. [2022-04-08 10:07:14,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 221 transitions. [2022-04-08 10:07:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:14,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:14,507 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:14,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:14,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:14,711 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash 401313666, now seen corresponding path program 9 times [2022-04-08 10:07:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:14,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022813751] [2022-04-08 10:07:14,714 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:14,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 401313666, now seen corresponding path program 10 times [2022-04-08 10:07:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:14,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790965771] [2022-04-08 10:07:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:14,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-08 10:07:14,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-08 10:07:14,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-08 10:07:14,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:14,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-08 10:07:14,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-08 10:07:14,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-08 10:07:14,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-08 10:07:14,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21739#(= main_~y~0 0)} is VALID [2022-04-08 10:07:14,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {21739#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:14,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {21740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:14,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {21741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:14,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {21742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:14,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {21744#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:14,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {21744#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:14,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:14,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:14,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:14,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:14,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:14,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:14,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:14,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:14,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:14,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:14,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-08 10:07:14,898 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-08 10:07:14,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-08 10:07:14,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-08 10:07:14,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-08 10:07:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790965771] [2022-04-08 10:07:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790965771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367328490] [2022-04-08 10:07:14,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:14,901 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-08 10:07:14,902 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-08 10:07:14,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:14,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:14,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:07:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:14,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:15,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21734#true} is VALID [2022-04-08 10:07:15,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-08 10:07:15,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-08 10:07:15,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-08 10:07:15,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-08 10:07:15,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21734#true} is VALID [2022-04-08 10:07:15,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {21734#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:15,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:15,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:15,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:15,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:15,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:15,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-08 10:07:15,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {21735#false} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-08 10:07:15,122 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-08 10:07:15,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-08 10:07:15,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-08 10:07:15,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-08 10:07:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:07:15,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:15,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-08 10:07:15,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-08 10:07:15,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-08 10:07:15,218 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-08 10:07:15,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {21735#false} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-08 10:07:15,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-08 10:07:15,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:15,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:15,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:15,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:15,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:15,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:15,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:15,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {21734#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:15,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21734#true} is VALID [2022-04-08 10:07:15,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-08 10:07:15,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-08 10:07:15,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-08 10:07:15,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-08 10:07:15,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21734#true} is VALID [2022-04-08 10:07:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:07:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367328490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:15,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:15,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:07:15,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:15,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022813751] [2022-04-08 10:07:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022813751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:15,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:15,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231585728] [2022-04-08 10:07:15,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:15,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:15,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:15,249 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-08 10:07:15,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:15,249 INFO L87 Difference]: Start difference. First operand 164 states and 221 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,294 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-08 10:07:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:07:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 148 transitions. [2022-04-08 10:07:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 148 transitions. [2022-04-08 10:07:18,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 148 transitions. [2022-04-08 10:07:18,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:18,422 INFO L225 Difference]: With dead ends: 235 [2022-04-08 10:07:18,422 INFO L226 Difference]: Without dead ends: 222 [2022-04-08 10:07:18,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=2605, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:07:18,423 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:18,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 77 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-08 10:07:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2022-04-08 10:07:18,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:18,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,978 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,979 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,981 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2022-04-08 10:07:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2022-04-08 10:07:18,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:18,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:18,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-08 10:07:18,982 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-08 10:07:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,985 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2022-04-08 10:07:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2022-04-08 10:07:18,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:18,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:18,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:18,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 228 transitions. [2022-04-08 10:07:18,989 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 228 transitions. Word has length 28 [2022-04-08 10:07:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:18,989 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 228 transitions. [2022-04-08 10:07:18,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-08 10:07:18,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 228 transitions. [2022-04-08 10:07:19,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2022-04-08 10:07:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:19,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:19,445 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:19,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 10:07:19,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:07:19,646 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1899162222, now seen corresponding path program 7 times [2022-04-08 10:07:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:19,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704063612] [2022-04-08 10:07:19,649 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:19,649 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1899162222, now seen corresponding path program 8 times [2022-04-08 10:07:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:19,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816732217] [2022-04-08 10:07:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:19,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-08 10:07:19,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-08 10:07:19,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-08 10:07:19,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:19,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-08 10:07:19,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-08 10:07:19,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-08 10:07:19,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-08 10:07:19,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23254#(= main_~y~0 0)} is VALID [2022-04-08 10:07:19,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {23254#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:19,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:19,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:19,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:19,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:19,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:19,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:19,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23261#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {23261#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:19,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-08 10:07:19,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-08 10:07:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:19,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816732217] [2022-04-08 10:07:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816732217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:19,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104391059] [2022-04-08 10:07:19,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:19,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:19,800 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-08 10:07:19,801 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-08 10:07:19,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:19,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:19,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:07:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:19,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:20,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23249#true} is VALID [2022-04-08 10:07:20,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-08 10:07:20,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-08 10:07:20,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-08 10:07:20,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-08 10:07:20,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23254#(= main_~y~0 0)} is VALID [2022-04-08 10:07:20,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {23254#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:20,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:20,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:20,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:20,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:20,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:20,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23305#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {23305#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-08 10:07:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:20,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-08 10:07:20,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {23387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-08 10:07:20,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {23391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:20,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {23391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:20,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:20,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {23402#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:20,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {23406#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23402#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:20,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {23410#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23406#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {23414#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23410#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:20,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {23418#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23414#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:20,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23418#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:20,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-08 10:07:20,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-08 10:07:20,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-08 10:07:20,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-08 10:07:20,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23249#true} is VALID [2022-04-08 10:07:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104391059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:20,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:07:20,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704063612] [2022-04-08 10:07:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704063612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:20,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:07:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567085744] [2022-04-08 10:07:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:20,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:07:20,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:20,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,287 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-08 10:07:20,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:07:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:07:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:07:20,288 INFO L87 Difference]: Start difference. First operand 171 states and 228 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,679 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2022-04-08 10:07:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:07:22,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:07:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-08 10:07:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-08 10:07:22,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2022-04-08 10:07:22,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,752 INFO L225 Difference]: With dead ends: 265 [2022-04-08 10:07:22,752 INFO L226 Difference]: Without dead ends: 251 [2022-04-08 10:07:22,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:07:22,753 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:22,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 84 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-08 10:07:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2022-04-08 10:07:23,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:23,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,308 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,308 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:23,310 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2022-04-08 10:07:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2022-04-08 10:07:23,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:23,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:23,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-08 10:07:23,311 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-08 10:07:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:23,315 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2022-04-08 10:07:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2022-04-08 10:07:23,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:23,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:23,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:23,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-04-08 10:07:23,319 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 28 [2022-04-08 10:07:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:23,319 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-04-08 10:07:23,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 227 transitions. [2022-04-08 10:07:23,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-04-08 10:07:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:07:23,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:23,768 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:23,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-08 10:07:23,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:23,971 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -811576638, now seen corresponding path program 23 times [2022-04-08 10:07:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898698147] [2022-04-08 10:07:23,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:23,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash -811576638, now seen corresponding path program 24 times [2022-04-08 10:07:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:23,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091588850] [2022-04-08 10:07:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-08 10:07:24,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-08 10:07:24,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-08 10:07:24,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:24,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-08 10:07:24,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-08 10:07:24,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-08 10:07:24,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-08 10:07:24,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24836#(= main_~y~0 0)} is VALID [2022-04-08 10:07:24,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {24836#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:24,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:24,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:24,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:24,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:24,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:24,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:24,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:24,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:24,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:24,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:24,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:24,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:24,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24849#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:24,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {24849#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,199 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-08 10:07:24,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-08 10:07:24,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-08 10:07:24,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-08 10:07:24,199 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-08 10:07:24,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:24,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091588850] [2022-04-08 10:07:24,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091588850] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165271289] [2022-04-08 10:07:24,200 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:24,201 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-08 10:07:24,201 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-08 10:07:24,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:07:24,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:24,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:07:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:24,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24831#true} is VALID [2022-04-08 10:07:24,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-08 10:07:24,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-08 10:07:24,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-08 10:07:24,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-08 10:07:24,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24836#(= main_~y~0 0)} is VALID [2022-04-08 10:07:24,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {24836#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:24,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:24,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:24,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:24,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:24,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:24,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:24,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:24,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:24,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:24,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:24,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:24,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:24,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:24,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {24911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-08 10:07:24,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-08 10:07:24,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-08 10:07:24,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-08 10:07:24,550 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-08 10:07:24,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:24,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-08 10:07:24,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-08 10:07:24,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {24957#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-08 10:07:24,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {24961#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24957#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:24,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {24961#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24961#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:24,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {24968#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24961#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:24,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {24972#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24968#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:24,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {24976#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24972#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:24,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {24980#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24976#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:24,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {24984#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24980#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:24,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {24988#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24984#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:24,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {24992#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24988#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:24,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {24996#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24992#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:24,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {25000#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24996#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:24,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {25004#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25000#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:24,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {25008#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25004#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:24,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {25012#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25008#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:24,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25012#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:24,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-08 10:07:24,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-08 10:07:24,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-08 10:07:24,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-08 10:07:24,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24831#true} is VALID [2022-04-08 10:07:24,936 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-08 10:07:24,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165271289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:24,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:24,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:07:24,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898698147] [2022-04-08 10:07:24,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898698147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:24,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:24,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:07:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796721727] [2022-04-08 10:07:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:24,938 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:24,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:24,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:24,959 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-08 10:07:24,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:07:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:07:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:07:24,960 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,413 INFO L93 Difference]: Finished difference Result 386 states and 557 transitions. [2022-04-08 10:07:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:07:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 10:07:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 10:07:30,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 10:07:30,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,559 INFO L225 Difference]: With dead ends: 386 [2022-04-08 10:07:30,559 INFO L226 Difference]: Without dead ends: 363 [2022-04-08 10:07:30,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:30,560 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 145 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:30,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 164 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:07:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-08 10:07:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 182. [2022-04-08 10:07:31,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:31,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,159 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,159 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:31,164 INFO L93 Difference]: Finished difference Result 363 states and 473 transitions. [2022-04-08 10:07:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 473 transitions. [2022-04-08 10:07:31,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:31,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:31,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-08 10:07:31,165 INFO L87 Difference]: Start difference. First operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-08 10:07:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:31,169 INFO L93 Difference]: Finished difference Result 363 states and 473 transitions. [2022-04-08 10:07:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 473 transitions. [2022-04-08 10:07:31,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:31,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:31,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:31,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 243 transitions. [2022-04-08 10:07:31,172 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 243 transitions. Word has length 28 [2022-04-08 10:07:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:31,172 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 243 transitions. [2022-04-08 10:07:31,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-08 10:07:31,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 243 transitions. [2022-04-08 10:07:31,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 243 transitions. [2022-04-08 10:07:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:07:31,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:31,735 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:31,753 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-08 10:07:31,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 10:07:31,952 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1242981297, now seen corresponding path program 25 times [2022-04-08 10:07:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:31,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409179293] [2022-04-08 10:07:31,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:31,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1242981297, now seen corresponding path program 26 times [2022-04-08 10:07:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474395357] [2022-04-08 10:07:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-08 10:07:32,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-08 10:07:32,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-08 10:07:32,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:32,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-08 10:07:32,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-08 10:07:32,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-08 10:07:32,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-08 10:07:32,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26928#(= main_~y~0 0)} is VALID [2022-04-08 10:07:32,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {26928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:32,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:32,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:32,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:32,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:32,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:32,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:32,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:32,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:32,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:32,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:32,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:32,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {26942#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:32,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {26942#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-08 10:07:32,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-08 10:07:32,248 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-08 10:07:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474395357] [2022-04-08 10:07:32,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474395357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332152416] [2022-04-08 10:07:32,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:32,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:32,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:32,250 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-08 10:07:32,277 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-08 10:07:32,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:32,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:32,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:07:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:32,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26923#true} is VALID [2022-04-08 10:07:32,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-08 10:07:32,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-08 10:07:32,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-08 10:07:32,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-08 10:07:32,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26928#(= main_~y~0 0)} is VALID [2022-04-08 10:07:32,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {26928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:32,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:32,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:32,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:32,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:32,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:32,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:32,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:32,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:32,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:32,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:32,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:32,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {27007#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {27007#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-08 10:07:32,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-08 10:07:32,600 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-08 10:07:32,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:33,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-08 10:07:33,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-08 10:07:33,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-08 10:07:33,024 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-08 10:07:33,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:33,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:33,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:33,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {27053#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-08 10:07:33,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {27057#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {27053#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:33,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {27057#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {27057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:33,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {27064#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:33,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {27068#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27064#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:33,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {27072#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27068#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:33,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {27076#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27072#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:33,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {27080#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27076#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:33,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {27084#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27080#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {27088#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27084#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:33,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {27092#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27088#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {27096#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27092#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:33,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {27100#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27096#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:33,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {27104#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27100#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:33,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {27108#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27104#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:33,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {27112#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27108#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:33,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27112#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:33,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-08 10:07:33,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-08 10:07:33,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-08 10:07:33,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-08 10:07:33,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26923#true} is VALID [2022-04-08 10:07:33,038 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-08 10:07:33,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332152416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:33,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:33,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:07:33,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409179293] [2022-04-08 10:07:33,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409179293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:33,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:33,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:07:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832239849] [2022-04-08 10:07:33,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:33,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:33,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:33,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:33,062 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-08 10:07:33,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:07:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:07:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:07:33,063 INFO L87 Difference]: Start difference. First operand 182 states and 243 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,356 INFO L93 Difference]: Finished difference Result 411 states and 595 transitions. [2022-04-08 10:07:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:07:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-04-08 10:07:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-04-08 10:07:39,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 189 transitions. [2022-04-08 10:07:39,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:39,514 INFO L225 Difference]: With dead ends: 411 [2022-04-08 10:07:39,514 INFO L226 Difference]: Without dead ends: 388 [2022-04-08 10:07:39,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:07:39,515 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:39,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 174 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 10:07:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-08 10:07:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 193. [2022-04-08 10:07:40,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:40,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,141 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,141 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:40,148 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2022-04-08 10:07:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2022-04-08 10:07:40,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:40,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:40,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 388 states. [2022-04-08 10:07:40,149 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 388 states. [2022-04-08 10:07:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:40,156 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2022-04-08 10:07:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2022-04-08 10:07:40,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:40,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:40,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:40,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 259 transitions. [2022-04-08 10:07:40,161 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 259 transitions. Word has length 29 [2022-04-08 10:07:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:40,161 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 259 transitions. [2022-04-08 10:07:40,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-08 10:07:40,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 259 transitions. [2022-04-08 10:07:41,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 259 transitions. [2022-04-08 10:07:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:41,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:41,143 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:41,161 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-08 10:07:41,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:41,351 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 9 times [2022-04-08 10:07:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912893483] [2022-04-08 10:07:41,354 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:41,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 10 times [2022-04-08 10:07:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909218267] [2022-04-08 10:07:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-08 10:07:41,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-08 10:07:41,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-08 10:07:41,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:41,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-08 10:07:41,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-08 10:07:41,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-08 10:07:41,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-08 10:07:41,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:41,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29158#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:41,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {29158#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29159#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:41,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {29159#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29160#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:41,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {29160#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-08 10:07:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909218267] [2022-04-08 10:07:41,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909218267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602693838] [2022-04-08 10:07:41,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:41,520 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-08 10:07:41,521 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-08 10:07:41,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:41,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:41,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:07:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:41,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29147#true} is VALID [2022-04-08 10:07:41,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-08 10:07:41,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-08 10:07:41,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-08 10:07:41,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-08 10:07:41,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#(= main_~y~0 0)} is VALID [2022-04-08 10:07:41,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:41,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:41,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:41,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:41,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29201#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {29201#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29205#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:41,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {29205#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29209#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {29209#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-08 10:07:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:07:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:41,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-08 10:07:41,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-08 10:07:41,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {29288#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-08 10:07:41,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {29292#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29288#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:41,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {29296#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29292#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:41,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {29300#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {29296#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:07:41,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {29304#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29300#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {29308#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29304#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {29147#true} ~z~0 := ~y~0; {29308#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {29147#true} assume !(~x~0 % 4294967296 > 0); {29147#true} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-08 10:07:41,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29147#true} is VALID [2022-04-08 10:07:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:07:41,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602693838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:41,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:41,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-08 10:07:41,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:41,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912893483] [2022-04-08 10:07:41,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912893483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:41,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:41,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377568505] [2022-04-08 10:07:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:41,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:41,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,980 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-08 10:07:41,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:07:41,981 INFO L87 Difference]: Start difference. First operand 193 states and 259 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:44,447 INFO L93 Difference]: Finished difference Result 280 states and 368 transitions. [2022-04-08 10:07:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:07:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:07:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:07:44,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-08 10:07:44,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:44,525 INFO L225 Difference]: With dead ends: 280 [2022-04-08 10:07:44,525 INFO L226 Difference]: Without dead ends: 265 [2022-04-08 10:07:44,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:07:44,526 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:44,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 76 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-08 10:07:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 193. [2022-04-08 10:07:45,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:45,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,221 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,221 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,224 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2022-04-08 10:07:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 351 transitions. [2022-04-08 10:07:45,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-08 10:07:45,225 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-08 10:07:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,228 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2022-04-08 10:07:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 351 transitions. [2022-04-08 10:07:45,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:45,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 258 transitions. [2022-04-08 10:07:45,231 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 258 transitions. Word has length 30 [2022-04-08 10:07:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:45,231 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 258 transitions. [2022-04-08 10:07:45,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:45,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 258 transitions. [2022-04-08 10:07:45,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 258 transitions. [2022-04-08 10:07:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:45,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:45,756 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:45,772 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-08 10:07:45,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:45,957 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1042510132, now seen corresponding path program 11 times [2022-04-08 10:07:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:45,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483474574] [2022-04-08 10:07:45,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:45,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1042510132, now seen corresponding path program 12 times [2022-04-08 10:07:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334352006] [2022-04-08 10:07:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-08 10:07:46,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-08 10:07:46,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-08 10:07:46,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:46,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-08 10:07:46,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-08 10:07:46,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-08 10:07:46,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-08 10:07:46,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30855#(= main_~y~0 0)} is VALID [2022-04-08 10:07:46,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {30855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:46,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {30856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:46,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {30857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:46,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {30858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:46,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {30859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:46,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:46,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30861#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:46,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {30861#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30862#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:46,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {30862#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30863#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:46,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {30863#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30864#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:46,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {30864#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30865#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {30865#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {30851#false} assume !(~y~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {30851#false} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-08 10:07:46,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-08 10:07:46,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-08 10:07:46,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-08 10:07:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:07:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334352006] [2022-04-08 10:07:46,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334352006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851063615] [2022-04-08 10:07:46,133 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:46,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:46,135 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-08 10:07:46,138 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-08 10:07:46,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:07:46,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:46,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:07:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:46,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:46,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30850#true} is VALID [2022-04-08 10:07:46,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30850#true} is VALID [2022-04-08 10:07:46,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:46,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:46,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:46,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:46,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:46,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:46,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,355 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-08 10:07:46,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-08 10:07:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:46,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:46,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-08 10:07:46,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-08 10:07:46,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-08 10:07:46,452 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-08 10:07:46,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-08 10:07:46,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:46,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:46,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:46,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:46,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:07:46,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:46,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:46,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:46,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-08 10:07:46,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30850#true} is VALID [2022-04-08 10:07:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:07:46,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851063615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:46,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:46,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:07:46,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:46,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483474574] [2022-04-08 10:07:46,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483474574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:46,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:46,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718741224] [2022-04-08 10:07:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:46,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:46,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:46,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-08 10:07:46,488 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-08 10:07:46,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:46,489 INFO L87 Difference]: Start difference. First operand 193 states and 258 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-08 10:07:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,180 INFO L93 Difference]: Finished difference Result 279 states and 367 transitions. [2022-04-08 10:07:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:07:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-08 10:07:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-08 10:07:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-08 10:07:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-08 10:07:49,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 97 transitions. [2022-04-08 10:07:49,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:49,262 INFO L225 Difference]: With dead ends: 279 [2022-04-08 10:07:49,262 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 10:07:49,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:07:49,263 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:49,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 83 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 10:07:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2022-04-08 10:07:49,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:49,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,886 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,886 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,889 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2022-04-08 10:07:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-08 10:07:49,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-08 10:07:49,889 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-08 10:07:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,893 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2022-04-08 10:07:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-08 10:07:49,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:49,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 258 transitions. [2022-04-08 10:07:49,897 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 258 transitions. Word has length 30 [2022-04-08 10:07:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:49,897 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 258 transitions. [2022-04-08 10:07:49,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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-08 10:07:49,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 258 transitions. [2022-04-08 10:07:50,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 258 transitions. [2022-04-08 10:07:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:50,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:50,399 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:50,416 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-08 10:07:50,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:50,603 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1702554722, now seen corresponding path program 11 times [2022-04-08 10:07:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231363659] [2022-04-08 10:07:50,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:50,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1702554722, now seen corresponding path program 12 times [2022-04-08 10:07:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:50,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370477434] [2022-04-08 10:07:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-08 10:07:50,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-08 10:07:50,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-08 10:07:50,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:50,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-08 10:07:50,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-08 10:07:50,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-08 10:07:50,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-08 10:07:50,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32552#(= main_~y~0 0)} is VALID [2022-04-08 10:07:50,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {32552#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:50,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:50,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:50,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:50,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:50,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:50,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:50,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:50,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32560#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {32560#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:50,770 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-08 10:07:50,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-08 10:07:50,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-08 10:07:50,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-08 10:07:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:07:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:50,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370477434] [2022-04-08 10:07:50,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370477434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:50,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528105184] [2022-04-08 10:07:50,771 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:50,772 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-08 10:07:50,773 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-08 10:07:50,827 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:07:50,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:50,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:07:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:51,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32547#true} is VALID [2022-04-08 10:07:51,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-08 10:07:51,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-08 10:07:51,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-08 10:07:51,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-08 10:07:51,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32552#(= main_~y~0 0)} is VALID [2022-04-08 10:07:51,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {32552#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:51,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:51,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:51,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:51,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:51,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:51,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:51,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:51,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32607#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {32607#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-08 10:07:51,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-08 10:07:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:07:51,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:51,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-08 10:07:51,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-08 10:07:51,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-08 10:07:51,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {32695#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-08 10:07:51,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {32699#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32695#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:51,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32699#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:51,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:51,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {32710#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:51,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {32714#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32710#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:51,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {32718#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32714#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:51,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {32722#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32718#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:51,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {32726#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32722#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:51,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {32730#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32726#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:51,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32730#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:51,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-08 10:07:51,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-08 10:07:51,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-08 10:07:51,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-08 10:07:51,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32547#true} is VALID [2022-04-08 10:07:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:07:51,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528105184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:51,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:51,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:07:51,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:51,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231363659] [2022-04-08 10:07:51,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231363659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:51,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:51,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947152730] [2022-04-08 10:07:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:51,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:51,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:51,375 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-08 10:07:51,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:07:51,376 INFO L87 Difference]: Start difference. First operand 194 states and 258 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,209 INFO L93 Difference]: Finished difference Result 302 states and 392 transitions. [2022-04-08 10:07:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:07:54,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:07:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-08 10:07:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-08 10:07:54,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2022-04-08 10:07:54,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:54,294 INFO L225 Difference]: With dead ends: 302 [2022-04-08 10:07:54,294 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 10:07:54,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:07:54,295 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:54,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 91 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 10:07:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2022-04-08 10:07:54,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:54,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,910 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,910 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,915 INFO L93 Difference]: Finished difference Result 287 states and 375 transitions. [2022-04-08 10:07:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 375 transitions. [2022-04-08 10:07:54,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:54,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:54,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 10:07:54,916 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 10:07:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:54,921 INFO L93 Difference]: Finished difference Result 287 states and 375 transitions. [2022-04-08 10:07:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 375 transitions. [2022-04-08 10:07:54,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:54,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:54,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:54,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-08 10:07:54,925 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 30 [2022-04-08 10:07:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:54,925 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-08 10:07:54,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-08 10:07:55,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-08 10:07:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:07:55,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:55,612 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:55,636 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-08 10:07:55,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 10:07:55,812 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1731623838, now seen corresponding path program 27 times [2022-04-08 10:07:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:55,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233886652] [2022-04-08 10:07:55,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:55,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1731623838, now seen corresponding path program 28 times [2022-04-08 10:07:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483551615] [2022-04-08 10:07:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:56,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-08 10:07:56,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-08 10:07:56,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34342#(= main_~y~0 0)} is VALID [2022-04-08 10:07:56,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {34342#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:56,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:56,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:56,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:56,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:56,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:56,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:56,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:56,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:56,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:56,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:56,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:56,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:56,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:56,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {34357#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {34357#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-08 10:07:56,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-08 10:07:56,124 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-08 10:07:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:56,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483551615] [2022-04-08 10:07:56,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483551615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:56,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724242950] [2022-04-08 10:07:56,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:56,125 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-08 10:07:56,126 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-08 10:07:56,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:56,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:56,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:07:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:56,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34337#true} is VALID [2022-04-08 10:07:56,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-08 10:07:56,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-08 10:07:56,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-08 10:07:56,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-08 10:07:56,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34342#(= main_~y~0 0)} is VALID [2022-04-08 10:07:56,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {34342#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:56,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:56,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:56,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:56,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:56,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:56,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:56,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:56,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:56,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:56,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:56,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:56,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:56,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:56,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {34425#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {34425#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-08 10:07:56,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-08 10:07:56,454 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-08 10:07:56,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:56,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-08 10:07:56,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-08 10:07:56,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-08 10:07:56,948 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-08 10:07:56,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {34471#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-08 10:07:56,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {34475#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {34471#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:56,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {34475#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {34475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:56,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {34482#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:56,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {34486#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34482#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:56,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {34490#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34486#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:56,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {34494#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34490#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:56,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {34498#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34494#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:56,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {34502#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34498#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {34506#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34502#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:56,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {34510#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34506#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {34514#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34510#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:56,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {34518#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34514#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:56,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {34522#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34518#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:56,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {34526#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34522#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:56,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {34530#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34526#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:56,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {34534#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34530#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:56,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34534#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:07:56,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-08 10:07:56,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-08 10:07:56,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-08 10:07:56,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-08 10:07:56,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34337#true} is VALID [2022-04-08 10:07:56,959 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-08 10:07:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724242950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:56,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:07:56,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:56,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233886652] [2022-04-08 10:07:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233886652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:56,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:07:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142682520] [2022-04-08 10:07:56,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:07:56,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:56,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:07:56,979 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-08 10:07:56,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:07:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:07:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:07:56,979 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:08:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:03,946 INFO L93 Difference]: Finished difference Result 437 states and 631 transitions. [2022-04-08 10:08:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:08:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:08:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:08:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 201 transitions. [2022-04-08 10:08:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:08:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 201 transitions. [2022-04-08 10:08:03,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 201 transitions. [2022-04-08 10:08:04,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:04,130 INFO L225 Difference]: With dead ends: 437 [2022-04-08 10:08:04,130 INFO L226 Difference]: Without dead ends: 414 [2022-04-08 10:08:04,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:08:04,131 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 174 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:04,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 186 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:08:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-08 10:08:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 205. [2022-04-08 10:08:04,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:04,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:04,836 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:04,836 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:04,842 INFO L93 Difference]: Finished difference Result 414 states and 539 transitions. [2022-04-08 10:08:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 539 transitions. [2022-04-08 10:08:04,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:04,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:04,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 414 states. [2022-04-08 10:08:04,843 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 414 states. [2022-04-08 10:08:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:04,849 INFO L93 Difference]: Finished difference Result 414 states and 539 transitions. [2022-04-08 10:08:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 539 transitions. [2022-04-08 10:08:04,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:04,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:04,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:04,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 273 transitions. [2022-04-08 10:08:04,852 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 273 transitions. Word has length 30 [2022-04-08 10:08:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:04,852 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 273 transitions. [2022-04-08 10:08:04,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-08 10:08:04,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 273 transitions. [2022-04-08 10:08:05,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2022-04-08 10:08:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:08:05,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:05,413 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:05,429 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-08 10:08:05,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 10:08:05,614 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 5 times [2022-04-08 10:08:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276679009] [2022-04-08 10:08:05,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:05,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 6 times [2022-04-08 10:08:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:05,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368946758] [2022-04-08 10:08:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-08 10:08:06,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-08 10:08:06,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-08 10:08:06,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:06,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-08 10:08:06,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-08 10:08:06,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-08 10:08:06,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-08 10:08:06,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36705#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-08 10:08:06,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {36705#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36706#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:08:06,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {36706#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:08:06,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:08:06,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:08:06,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:08:06,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:08:06,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:08:06,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:08:06,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,072 INFO L272 TraceCheckUtils]: 27: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:08:06,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36714#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:08:06,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {36714#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36700#false} is VALID [2022-04-08 10:08:06,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-08 10:08:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:08:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:06,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368946758] [2022-04-08 10:08:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368946758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:06,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937499317] [2022-04-08 10:08:06,073 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:06,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:06,082 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-08 10:08:06,091 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-08 10:08:06,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:08:06,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:06,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:08:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:06,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36699#true} is VALID [2022-04-08 10:08:06,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-08 10:08:06,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-08 10:08:06,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-08 10:08:06,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-08 10:08:06,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:06,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:08:06,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:08:06,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:06,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:06,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:08:06,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:06,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:08:06,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:06,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:06,372 INFO L272 TraceCheckUtils]: 27: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:06,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:06,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {36806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36700#false} is VALID [2022-04-08 10:08:06,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-08 10:08:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:08:06,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:06,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-08 10:08:06,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {36806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36700#false} is VALID [2022-04-08 10:08:06,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:06,743 INFO L272 TraceCheckUtils]: 27: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:06,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:08:06,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:08:06,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} ~z~0 := ~y~0; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:08:06,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:08:06,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:08:06,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:06,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:06,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-08 10:08:06,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-08 10:08:06,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-08 10:08:06,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-08 10:08:06,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36699#true} is VALID [2022-04-08 10:08:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:08:06,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937499317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:06,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:06,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2022-04-08 10:08:06,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:06,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276679009] [2022-04-08 10:08:06,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276679009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:06,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:06,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:08:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679155372] [2022-04-08 10:08:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:08:06,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:06,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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-08 10:08:06,819 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-08 10:08:06,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:08:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:08:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:08:06,820 INFO L87 Difference]: Start difference. First operand 205 states and 273 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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-08 10:08:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:08,376 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2022-04-08 10:08:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:08:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:08:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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-08 10:08:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-08 10:08:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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-08 10:08:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-08 10:08:08,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-08 10:08:08,441 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-08 10:08:08,444 INFO L225 Difference]: With dead ends: 215 [2022-04-08 10:08:08,444 INFO L226 Difference]: Without dead ends: 206 [2022-04-08 10:08:08,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:08,444 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:08,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 61 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:08:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-08 10:08:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-08 10:08:09,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:09,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,139 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,139 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:09,141 INFO L93 Difference]: Finished difference Result 206 states and 274 transitions. [2022-04-08 10:08:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-08 10:08:09,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:09,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:09,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-08 10:08:09,142 INFO L87 Difference]: Start difference. First operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-08 10:08:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:09,144 INFO L93 Difference]: Finished difference Result 206 states and 274 transitions. [2022-04-08 10:08:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-08 10:08:09,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:09,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:09,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:09,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 274 transitions. [2022-04-08 10:08:09,148 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 274 transitions. Word has length 31 [2022-04-08 10:08:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:09,148 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 274 transitions. [2022-04-08 10:08:09,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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-08 10:08:09,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 274 transitions. [2022-04-08 10:08:09,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-08 10:08:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:08:09,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:09,789 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:09,805 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-08 10:08:09,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:09,990 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1558438816, now seen corresponding path program 13 times [2022-04-08 10:08:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:09,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336484024] [2022-04-08 10:08:09,992 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:09,992 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1558438816, now seen corresponding path program 14 times [2022-04-08 10:08:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:09,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402517683] [2022-04-08 10:08:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-08 10:08:10,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-08 10:08:10,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-08 10:08:10,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:10,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-08 10:08:10,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-08 10:08:10,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-08 10:08:10,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-08 10:08:10,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38185#(= main_~y~0 0)} is VALID [2022-04-08 10:08:10,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {38185#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:10,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {38186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:10,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {38187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:10,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {38188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:10,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {38189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {38191#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:10,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {38191#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:10,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:10,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:10,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:10,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:10,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:10,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:10,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:10,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:10,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:10,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:10,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:10,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:10,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-08 10:08:10,256 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-08 10:08:10,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-08 10:08:10,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-08 10:08:10,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-08 10:08:10,256 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-08 10:08:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:10,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402517683] [2022-04-08 10:08:10,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402517683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:10,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621948751] [2022-04-08 10:08:10,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:10,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:10,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:10,258 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-08 10:08:10,259 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-08 10:08:10,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:10,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:10,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:08:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:10,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38180#true} is VALID [2022-04-08 10:08:10,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-08 10:08:10,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-08 10:08:10,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-08 10:08:10,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-08 10:08:10,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38180#true} is VALID [2022-04-08 10:08:10,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {38180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:10,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:10,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:10,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:10,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:10,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:10,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:10,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:10,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {38181#false} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-08 10:08:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:08:10,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:10,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-08 10:08:10,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-08 10:08:10,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-08 10:08:10,615 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-08 10:08:10,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {38181#false} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-08 10:08:10,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-08 10:08:10,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:10,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:10,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:10,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:10,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:10,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:10,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:10,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:10,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:10,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {38180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:10,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38180#true} is VALID [2022-04-08 10:08:10,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-08 10:08:10,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-08 10:08:10,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-08 10:08:10,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-08 10:08:10,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38180#true} is VALID [2022-04-08 10:08:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:08:10,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621948751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:10,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:10,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:08:10,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:10,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336484024] [2022-04-08 10:08:10,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336484024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:10,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:10,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443324930] [2022-04-08 10:08:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:10,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:08:10,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:10,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:10,650 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-08 10:08:10,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:10,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:10,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:08:10,651 INFO L87 Difference]: Start difference. First operand 206 states and 274 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:16,289 INFO L93 Difference]: Finished difference Result 321 states and 448 transitions. [2022-04-08 10:08:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-08 10:08:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:08:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 205 transitions. [2022-04-08 10:08:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 205 transitions. [2022-04-08 10:08:16,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 205 transitions. [2022-04-08 10:08:16,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:16,466 INFO L225 Difference]: With dead ends: 321 [2022-04-08 10:08:16,466 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 10:08:16,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=4481, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:08:16,467 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 92 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:16,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 101 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:08:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 10:08:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 214. [2022-04-08 10:08:17,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:17,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,208 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,209 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:17,214 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-04-08 10:08:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 389 transitions. [2022-04-08 10:08:17,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:17,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:17,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 10:08:17,215 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 10:08:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:17,220 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-04-08 10:08:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 389 transitions. [2022-04-08 10:08:17,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:17,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:17,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:17,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 282 transitions. [2022-04-08 10:08:17,224 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 282 transitions. Word has length 31 [2022-04-08 10:08:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:17,224 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 282 transitions. [2022-04-08 10:08:17,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:17,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 282 transitions. [2022-04-08 10:08:18,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 282 transitions. [2022-04-08 10:08:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:08:18,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:18,039 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:18,055 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-08 10:08:18,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 10:08:18,240 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 300326575, now seen corresponding path program 29 times [2022-04-08 10:08:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:18,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691873726] [2022-04-08 10:08:18,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:18,243 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:18,243 INFO L85 PathProgramCache]: Analyzing trace with hash 300326575, now seen corresponding path program 30 times [2022-04-08 10:08:18,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:18,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998370486] [2022-04-08 10:08:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:18,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-08 10:08:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-08 10:08:18,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-08 10:08:18,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-08 10:08:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-08 10:08:18,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-08 10:08:18,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-08 10:08:18,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40175#(= main_~y~0 0)} is VALID [2022-04-08 10:08:18,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {40175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:18,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:18,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:18,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:18,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:18,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:18,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:18,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:18,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:18,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:18,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:18,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:18,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:18,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:18,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40191#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {40191#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-08 10:08:18,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-08 10:08:18,569 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-08 10:08:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:18,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998370486] [2022-04-08 10:08:18,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998370486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:18,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184143442] [2022-04-08 10:08:18,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:18,571 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-08 10:08:18,596 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-08 10:08:18,769 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:08:18,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:18,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:08:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:19,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40170#true} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-08 10:08:19,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-08 10:08:19,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40175#(= main_~y~0 0)} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {40175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:19,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:19,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:19,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:19,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:19,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:19,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:19,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:19,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:19,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:19,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:19,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:19,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40262#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {40262#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-08 10:08:19,069 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-08 10:08:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {40308#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-08 10:08:19,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {40312#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {40308#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:19,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {40312#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:19,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {40319#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:19,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {40323#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40319#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:19,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {40327#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40323#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:19,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {40331#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40327#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:19,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {40335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40331#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:19,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {40339#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:19,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {40343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40339#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:19,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {40347#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:19,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {40351#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40347#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:19,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {40355#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40351#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:19,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {40359#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40355#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:19,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {40363#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40359#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:19,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {40367#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40363#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:19,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {40371#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40367#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:19,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {40375#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40371#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:19,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40375#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:19,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-08 10:08:19,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-08 10:08:19,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-08 10:08:19,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-08 10:08:19,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40170#true} is VALID [2022-04-08 10:08:19,620 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-08 10:08:19,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184143442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:19,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:19,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:08:19,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:19,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691873726] [2022-04-08 10:08:19,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691873726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:19,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:19,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:08:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216649609] [2022-04-08 10:08:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:19,621 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:19,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:19,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:19,641 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-08 10:08:19,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:08:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:08:19,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:08:19,642 INFO L87 Difference]: Start difference. First operand 214 states and 282 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:28,247 INFO L93 Difference]: Finished difference Result 502 states and 724 transitions. [2022-04-08 10:08:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:08:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 213 transitions. [2022-04-08 10:08:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 213 transitions. [2022-04-08 10:08:28,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 213 transitions. [2022-04-08 10:08:28,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:28,449 INFO L225 Difference]: With dead ends: 502 [2022-04-08 10:08:28,449 INFO L226 Difference]: Without dead ends: 479 [2022-04-08 10:08:28,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:08:28,450 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 189 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:28,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 198 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:08:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-04-08 10:08:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 225. [2022-04-08 10:08:29,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:29,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:29,225 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:29,226 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:29,236 INFO L93 Difference]: Finished difference Result 479 states and 628 transitions. [2022-04-08 10:08:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 628 transitions. [2022-04-08 10:08:29,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:29,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:29,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 479 states. [2022-04-08 10:08:29,237 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 479 states. [2022-04-08 10:08:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:29,247 INFO L93 Difference]: Finished difference Result 479 states and 628 transitions. [2022-04-08 10:08:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 628 transitions. [2022-04-08 10:08:29,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:29,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:29,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:29,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 298 transitions. [2022-04-08 10:08:29,252 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 298 transitions. Word has length 31 [2022-04-08 10:08:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:29,252 INFO L478 AbstractCegarLoop]: Abstraction has 225 states and 298 transitions. [2022-04-08 10:08:29,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-08 10:08:29,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 298 transitions. [2022-04-08 10:08:29,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 298 transitions. [2022-04-08 10:08:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:29,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:29,951 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:29,955 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-08 10:08:30,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:08:30,152 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 7 times [2022-04-08 10:08:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:30,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385942384] [2022-04-08 10:08:30,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:30,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 8 times [2022-04-08 10:08:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:30,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885647587] [2022-04-08 10:08:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:30,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-08 10:08:30,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-08 10:08:30,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:30,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-08 10:08:30,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-08 10:08:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:08:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:30,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885647587] [2022-04-08 10:08:30,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885647587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:30,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951213951] [2022-04-08 10:08:30,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:30,267 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-08 10:08:30,292 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-08 10:08:30,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:30,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:30,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:08:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:30,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:30,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,461 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-08 10:08:30,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-08 10:08:30,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-08 10:08:30,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-08 10:08:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:08:30,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:30,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-08 10:08:30,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-08 10:08:30,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-08 10:08:30,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:30,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:08:30,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-08 10:08:30,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42842#true} is VALID [2022-04-08 10:08:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:08:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951213951] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:30,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-08 10:08:30,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385942384] [2022-04-08 10:08:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385942384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:30,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:08:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462372331] [2022-04-08 10:08:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:30,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:30,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:30,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:30,690 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-08 10:08:30,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:08:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:08:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:08:30,690 INFO L87 Difference]: Start difference. First operand 225 states and 298 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,139 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-04-08 10:08:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:08:32,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 10:08:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 10:08:32,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-08 10:08:32,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:32,197 INFO L225 Difference]: With dead ends: 252 [2022-04-08 10:08:32,197 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 10:08:32,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:08:32,198 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:32,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:08:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 10:08:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2022-04-08 10:08:32,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:32,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,933 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,933 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,935 INFO L93 Difference]: Finished difference Result 226 states and 301 transitions. [2022-04-08 10:08:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 301 transitions. [2022-04-08 10:08:32,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:32,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:32,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:08:32,936 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-08 10:08:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,938 INFO L93 Difference]: Finished difference Result 226 states and 301 transitions. [2022-04-08 10:08:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 301 transitions. [2022-04-08 10:08:32,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:32,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:32,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:32,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2022-04-08 10:08:32,941 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 32 [2022-04-08 10:08:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:32,941 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2022-04-08 10:08:32,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:32,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 282 transitions. [2022-04-08 10:08:33,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2022-04-08 10:08:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:33,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:33,629 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:33,645 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-08 10:08:33,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:08:33,829 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 7 times [2022-04-08 10:08:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902528552] [2022-04-08 10:08:33,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:33,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 8 times [2022-04-08 10:08:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:33,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679472731] [2022-04-08 10:08:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:33,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-08 10:08:33,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-08 10:08:33,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-08 10:08:33,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:33,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-08 10:08:33,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-08 10:08:33,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-08 10:08:33,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-08 10:08:33,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-08 10:08:33,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:33,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44435#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:08:33,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {44435#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44436#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:33,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {44436#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:08:33,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:08:33,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:08:33,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44438#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:08:33,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {44438#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44439#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:33,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {44439#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44440#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:33,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {44440#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:33,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-08 10:08:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:08:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:33,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679472731] [2022-04-08 10:08:33,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679472731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:33,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450063542] [2022-04-08 10:08:33,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:33,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:33,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:33,977 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-08 10:08:34,003 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-08 10:08:34,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:34,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:34,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:08:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:34,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:34,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44429#true} is VALID [2022-04-08 10:08:34,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-08 10:08:34,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-08 10:08:34,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-08 10:08:34,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-08 10:08:34,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-08 10:08:34,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:34,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:34,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:34,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:34,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:34,226 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-08 10:08:34,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-08 10:08:34,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-08 10:08:34,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-08 10:08:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:08:34,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:34,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-08 10:08:34,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-08 10:08:34,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-08 10:08:34,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:34,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:34,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:08:34,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:34,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:34,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:34,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-08 10:08:34,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-08 10:08:34,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-08 10:08:34,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-08 10:08:34,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-08 10:08:34,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44429#true} is VALID [2022-04-08 10:08:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:08:34,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450063542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:34,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:34,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-08 10:08:34,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:34,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902528552] [2022-04-08 10:08:34,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902528552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:34,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:34,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:08:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117515280] [2022-04-08 10:08:34,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:34,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:34,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:34,393 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-08 10:08:34,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:08:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:08:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:08:34,393 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:36,527 INFO L93 Difference]: Finished difference Result 291 states and 404 transitions. [2022-04-08 10:08:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:08:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-04-08 10:08:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-04-08 10:08:36,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2022-04-08 10:08:36,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:36,616 INFO L225 Difference]: With dead ends: 291 [2022-04-08 10:08:36,616 INFO L226 Difference]: Without dead ends: 280 [2022-04-08 10:08:36,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:08:36,617 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:36,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 49 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:08:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-08 10:08:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 252. [2022-04-08 10:08:37,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:37,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:37,645 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:37,645 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:37,649 INFO L93 Difference]: Finished difference Result 280 states and 381 transitions. [2022-04-08 10:08:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2022-04-08 10:08:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:37,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-08 10:08:37,650 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-08 10:08:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:37,653 INFO L93 Difference]: Finished difference Result 280 states and 381 transitions. [2022-04-08 10:08:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2022-04-08 10:08:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:37,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:37,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 336 transitions. [2022-04-08 10:08:37,656 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 336 transitions. Word has length 32 [2022-04-08 10:08:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:37,657 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 336 transitions. [2022-04-08 10:08:37,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:37,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 336 transitions. [2022-04-08 10:08:38,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 336 transitions. [2022-04-08 10:08:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:38,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:38,632 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:38,649 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-08 10:08:38,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:38,839 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 13 times [2022-04-08 10:08:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795991608] [2022-04-08 10:08:38,843 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:38,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 14 times [2022-04-08 10:08:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:38,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53233429] [2022-04-08 10:08:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:39,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-08 10:08:39,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-08 10:08:39,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46305#(= main_~y~0 0)} is VALID [2022-04-08 10:08:39,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {46305#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:39,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:39,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:39,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:39,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:39,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:39,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46314#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {46314#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-08 10:08:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:39,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53233429] [2022-04-08 10:08:39,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53233429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713347584] [2022-04-08 10:08:39,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:39,016 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-08 10:08:39,018 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-08 10:08:39,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:39,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:39,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:08:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:39,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:39,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46300#true} is VALID [2022-04-08 10:08:39,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-08 10:08:39,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-08 10:08:39,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-08 10:08:39,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-08 10:08:39,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46305#(= main_~y~0 0)} is VALID [2022-04-08 10:08:39,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {46305#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:39,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:39,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:39,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:39,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:39,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:39,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:39,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:39,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46364#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:39,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {46364#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-08 10:08:39,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-08 10:08:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:39,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-08 10:08:39,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {46458#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-08 10:08:39,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {46462#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46458#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:39,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {46466#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46462#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:39,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {46466#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:39,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:39,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {46477#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:39,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {46481#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46477#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:39,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {46485#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46481#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:39,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {46489#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46485#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:39,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {46493#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46489#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:39,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {46497#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46493#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:39,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46497#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:39,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-08 10:08:39,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-08 10:08:39,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-08 10:08:39,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-08 10:08:39,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46300#true} is VALID [2022-04-08 10:08:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:08:39,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713347584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:39,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:39,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:08:39,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795991608] [2022-04-08 10:08:39,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795991608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:39,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:39,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:08:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83136711] [2022-04-08 10:08:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:39,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:39,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:39,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:39,547 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-08 10:08:39,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:08:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:08:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:08:39,547 INFO L87 Difference]: Start difference. First operand 252 states and 336 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:43,327 INFO L93 Difference]: Finished difference Result 370 states and 478 transitions. [2022-04-08 10:08:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:08:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-08 10:08:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-08 10:08:43,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2022-04-08 10:08:43,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:43,416 INFO L225 Difference]: With dead ends: 370 [2022-04-08 10:08:43,416 INFO L226 Difference]: Without dead ends: 354 [2022-04-08 10:08:43,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:08:43,417 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:43,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 87 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:08:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-08 10:08:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 252. [2022-04-08 10:08:44,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:44,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,461 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,461 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:44,466 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2022-04-08 10:08:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2022-04-08 10:08:44,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:44,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:44,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 354 states. [2022-04-08 10:08:44,466 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 354 states. [2022-04-08 10:08:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:44,470 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2022-04-08 10:08:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2022-04-08 10:08:44,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:44,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:44,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:44,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2022-04-08 10:08:44,474 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 32 [2022-04-08 10:08:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:44,474 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2022-04-08 10:08:44,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 335 transitions. [2022-04-08 10:08:45,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2022-04-08 10:08:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:45,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:45,391 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:45,409 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-08 10:08:45,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:45,592 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:45,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 741226194, now seen corresponding path program 15 times [2022-04-08 10:08:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:45,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904236406] [2022-04-08 10:08:45,594 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:45,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 741226194, now seen corresponding path program 16 times [2022-04-08 10:08:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:45,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808720615] [2022-04-08 10:08:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-08 10:08:45,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-08 10:08:45,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-08 10:08:45,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:45,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-08 10:08:45,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-08 10:08:45,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-08 10:08:45,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-08 10:08:45,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48501#(= main_~y~0 0)} is VALID [2022-04-08 10:08:45,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {48501#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:45,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:45,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:45,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:45,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:45,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:45,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:45,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:45,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48510#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {48510#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:45,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:45,758 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-08 10:08:45,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-08 10:08:45,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-08 10:08:45,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-08 10:08:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:08:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808720615] [2022-04-08 10:08:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808720615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684865814] [2022-04-08 10:08:45,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:45,759 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-08 10:08:45,760 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-08 10:08:45,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:45,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:45,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:08:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:46,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48496#true} is VALID [2022-04-08 10:08:46,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-08 10:08:46,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-08 10:08:46,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-08 10:08:46,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-08 10:08:46,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48501#(= main_~y~0 0)} is VALID [2022-04-08 10:08:46,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {48501#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:46,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:46,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:46,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:46,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:46,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:46,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:46,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:46,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:46,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48560#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {48560#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-08 10:08:46,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-08 10:08:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:08:46,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:46,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-08 10:08:46,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-08 10:08:46,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {48654#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-08 10:08:46,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {48658#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48654#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:46,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {48658#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:46,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:46,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {48669#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:46,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {48673#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48669#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:46,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {48677#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48673#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:46,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {48681#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48677#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:46,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {48685#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48681#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:46,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {48689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48685#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:46,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {48693#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:46,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48693#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:46,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-08 10:08:46,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-08 10:08:46,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-08 10:08:46,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-08 10:08:46,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48496#true} is VALID [2022-04-08 10:08:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:08:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684865814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:46,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:46,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:08:46,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904236406] [2022-04-08 10:08:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904236406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:46,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:46,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:08:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456596943] [2022-04-08 10:08:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:46,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:46,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:46,297 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-08 10:08:46,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:08:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:08:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:08:46,297 INFO L87 Difference]: Start difference. First operand 252 states and 335 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:50,558 INFO L93 Difference]: Finished difference Result 395 states and 506 transitions. [2022-04-08 10:08:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:08:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:08:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-04-08 10:08:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-04-08 10:08:50,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 107 transitions. [2022-04-08 10:08:50,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:50,649 INFO L225 Difference]: With dead ends: 395 [2022-04-08 10:08:50,649 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 10:08:50,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:08:50,650 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 78 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:50,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 100 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 10:08:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 252. [2022-04-08 10:08:51,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:51,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,722 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,723 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:51,728 INFO L93 Difference]: Finished difference Result 379 states and 489 transitions. [2022-04-08 10:08:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2022-04-08 10:08:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:51,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 10:08:51,729 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 10:08:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:51,733 INFO L93 Difference]: Finished difference Result 379 states and 489 transitions. [2022-04-08 10:08:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2022-04-08 10:08:51,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:51,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:51,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:51,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2022-04-08 10:08:51,737 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 32 [2022-04-08 10:08:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:51,737 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2022-04-08 10:08:51,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:51,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 334 transitions. [2022-04-08 10:08:52,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2022-04-08 10:08:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:52,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:52,675 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:52,691 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-08 10:08:52,875 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,SelfDestructingSolverStorable42 [2022-04-08 10:08:52,876 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1133720062, now seen corresponding path program 31 times [2022-04-08 10:08:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:52,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783144437] [2022-04-08 10:08:52,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:52,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1133720062, now seen corresponding path program 32 times [2022-04-08 10:08:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416684173] [2022-04-08 10:08:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:53,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-08 10:08:53,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-08 10:08:53,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-08 10:08:53,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:53,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-08 10:08:53,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-08 10:08:53,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-08 10:08:53,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-08 10:08:53,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50793#(= main_~y~0 0)} is VALID [2022-04-08 10:08:53,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {50793#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:53,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:53,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:53,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:53,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:53,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:53,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:53,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:53,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:53,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:53,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:53,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:53,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:53,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:53,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:53,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:53,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:53,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {50810#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:53,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {50810#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-08 10:08:53,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-08 10:08:53,177 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-08 10:08:53,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416684173] [2022-04-08 10:08:53,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416684173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911549687] [2022-04-08 10:08:53,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:53,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:53,178 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-08 10:08:53,179 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-08 10:08:53,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:53,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:53,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:08:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:53,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:53,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50788#true} is VALID [2022-04-08 10:08:53,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-08 10:08:53,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-08 10:08:53,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-08 10:08:53,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-08 10:08:53,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50793#(= main_~y~0 0)} is VALID [2022-04-08 10:08:53,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {50793#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:53,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:53,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:53,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:53,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:53,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:53,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:53,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:53,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:53,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:53,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:53,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:53,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:53,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:53,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:53,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:53,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:53,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {50884#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {50884#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-08 10:08:53,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-08 10:08:53,521 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-08 10:08:53,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:54,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {50930#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-08 10:08:54,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {50934#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {50930#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:54,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {50934#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {50934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:54,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {50941#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:54,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {50945#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50941#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:54,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {50949#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50945#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:54,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {50953#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50949#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:54,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {50957#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50953#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:54,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {50961#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50957#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:54,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {50965#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50961#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:54,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {50969#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50965#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:54,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {50973#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50969#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:54,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {50977#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50973#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:54,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {50981#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50977#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:54,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {50985#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50981#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:54,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {50989#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50985#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:54,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {50993#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50989#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:54,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {50997#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50993#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:54,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {51001#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50997#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:54,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51001#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:08:54,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-08 10:08:54,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-08 10:08:54,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-08 10:08:54,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-08 10:08:54,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50788#true} is VALID [2022-04-08 10:08:54,091 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-08 10:08:54,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911549687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:54,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:54,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:08:54,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:54,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783144437] [2022-04-08 10:08:54,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783144437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:54,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:54,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:08:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033264686] [2022-04-08 10:08:54,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:08:54,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:54,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:08:54,112 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-08 10:08:54,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:08:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:08:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:08:54,114 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:09:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,086 INFO L93 Difference]: Finished difference Result 573 states and 820 transitions. [2022-04-08 10:09:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:09:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:09:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:09:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-08 10:09:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:09:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-08 10:09:04,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 221 transitions. [2022-04-08 10:09:04,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:04,276 INFO L225 Difference]: With dead ends: 573 [2022-04-08 10:09:04,276 INFO L226 Difference]: Without dead ends: 541 [2022-04-08 10:09:04,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:09:04,277 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 184 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:04,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 207 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:09:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-04-08 10:09:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 265. [2022-04-08 10:09:05,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:05,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:05,436 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:05,436 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:05,444 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2022-04-08 10:09:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 693 transitions. [2022-04-08 10:09:05,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:05,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:05,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-08 10:09:05,445 INFO L87 Difference]: Start difference. First operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-08 10:09:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:05,458 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2022-04-08 10:09:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 693 transitions. [2022-04-08 10:09:05,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:05,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:05,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:05,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 353 transitions. [2022-04-08 10:09:05,463 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 353 transitions. Word has length 32 [2022-04-08 10:09:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:05,464 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 353 transitions. [2022-04-08 10:09:05,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-08 10:09:05,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 353 transitions. [2022-04-08 10:09:06,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2022-04-08 10:09:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:06,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:06,480 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:06,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:06,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-08 10:09:06,680 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -597404912, now seen corresponding path program 15 times [2022-04-08 10:09:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:06,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442324820] [2022-04-08 10:09:06,683 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:06,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash -597404912, now seen corresponding path program 16 times [2022-04-08 10:09:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373083285] [2022-04-08 10:09:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:06,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-08 10:09:06,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-08 10:09:06,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-08 10:09:06,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:06,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-08 10:09:06,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-08 10:09:06,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-08 10:09:06,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-08 10:09:06,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53821#(= main_~y~0 0)} is VALID [2022-04-08 10:09:06,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {53821#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53822#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:06,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {53822#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53823#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:06,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {53823#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53824#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:06,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {53824#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53825#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:06,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {53825#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53826#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:06,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {53826#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:06,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:06,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {53828#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:06,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {53828#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53829#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:06,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {53829#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53830#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:06,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {53830#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53831#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:06,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {53831#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:06,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {53832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53833#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {53833#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {53817#false} assume !(~y~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {53817#false} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:06,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:06,901 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-08 10:09:06,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-08 10:09:06,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-08 10:09:06,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-08 10:09:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:09:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:06,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373083285] [2022-04-08 10:09:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373083285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229882416] [2022-04-08 10:09:06,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:06,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:06,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:06,903 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:06,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:09:06,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:06,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:06,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:09:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:06,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:07,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53816#true} is VALID [2022-04-08 10:09:07,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53816#true} is VALID [2022-04-08 10:09:07,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:07,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:07,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:07,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:07,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:07,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:07,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:07,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:07,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:07,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:07,199 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-08 10:09:07,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-08 10:09:07,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-08 10:09:07,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-08 10:09:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:09:07,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:07,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-08 10:09:07,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-08 10:09:07,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-08 10:09:07,315 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-08 10:09:07,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:07,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-08 10:09:07,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:07,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:07,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:07,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:07,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:07,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:07,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:07,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:07,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:07,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:07,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53816#true} is VALID [2022-04-08 10:09:07,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53816#true} is VALID [2022-04-08 10:09:07,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-08 10:09:07,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-08 10:09:07,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-08 10:09:07,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-08 10:09:07,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53816#true} is VALID [2022-04-08 10:09:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:09:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229882416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:07,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:07,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:09:07,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442324820] [2022-04-08 10:09:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442324820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:07,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:07,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:09:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271332187] [2022-04-08 10:09:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:09:07,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:07,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-08 10:09:07,345 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-08 10:09:07,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:09:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:09:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:09:07,346 INFO L87 Difference]: Start difference. First operand 265 states and 353 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-08 10:09:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:11,466 INFO L93 Difference]: Finished difference Result 382 states and 496 transitions. [2022-04-08 10:09:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:09:11,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:09:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-08 10:09:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 10:09:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-08 10:09:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 10:09:11,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-08 10:09:11,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:11,556 INFO L225 Difference]: With dead ends: 382 [2022-04-08 10:09:11,556 INFO L226 Difference]: Without dead ends: 346 [2022-04-08 10:09:11,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:09:11,558 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 66 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:11,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 87 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:09:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-08 10:09:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 266. [2022-04-08 10:09:12,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:12,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:12,648 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:12,648 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:12,652 INFO L93 Difference]: Finished difference Result 346 states and 456 transitions. [2022-04-08 10:09:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-04-08 10:09:12,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:12,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:12,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-08 10:09:12,653 INFO L87 Difference]: Start difference. First operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-08 10:09:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:12,657 INFO L93 Difference]: Finished difference Result 346 states and 456 transitions. [2022-04-08 10:09:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-04-08 10:09:12,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:12,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:12,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:12,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2022-04-08 10:09:12,661 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 33 [2022-04-08 10:09:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:12,661 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2022-04-08 10:09:12,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-08 10:09:12,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 352 transitions. [2022-04-08 10:09:13,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2022-04-08 10:09:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:13,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:13,751 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:13,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:13,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 10:09:13,952 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1655474447, now seen corresponding path program 33 times [2022-04-08 10:09:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:13,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974799568] [2022-04-08 10:09:13,955 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:13,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1655474447, now seen corresponding path program 34 times [2022-04-08 10:09:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:13,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547351606] [2022-04-08 10:09:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:14,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-08 10:09:14,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-08 10:09:14,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-08 10:09:14,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:14,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-08 10:09:14,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-08 10:09:14,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-08 10:09:14,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-08 10:09:14,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56075#(= main_~y~0 0)} is VALID [2022-04-08 10:09:14,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {56075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:14,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:14,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:14,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:14,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:14,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:14,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:14,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:14,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:14,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:14,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:14,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:14,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:14,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:14,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:14,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:14,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:14,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:14,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56093#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {56093#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-08 10:09:14,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-08 10:09:14,293 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-08 10:09:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547351606] [2022-04-08 10:09:14,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547351606] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194063429] [2022-04-08 10:09:14,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:14,295 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:09:14,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:14,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:14,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:09:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:14,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:14,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56070#true} is VALID [2022-04-08 10:09:14,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-08 10:09:14,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-08 10:09:14,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-08 10:09:14,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-08 10:09:14,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56075#(= main_~y~0 0)} is VALID [2022-04-08 10:09:14,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {56075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:14,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:14,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:14,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:14,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:14,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:14,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:14,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:14,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:14,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:14,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:14,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:14,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:14,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:14,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:14,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:14,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:14,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:14,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56170#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {56170#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-08 10:09:14,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-08 10:09:14,658 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-08 10:09:14,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:15,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-08 10:09:15,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:15,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {56216#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-08 10:09:15,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {56220#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {56216#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:15,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {56220#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {56220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:15,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {56227#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:15,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {56231#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:15,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {56235#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:15,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {56239#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:15,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {56243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:15,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {56247#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:15,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {56251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56247#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:15,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {56255#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:15,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {56259#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56255#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:15,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {56263#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56259#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:15,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {56267#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56263#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:15,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {56271#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56267#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:15,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {56275#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56271#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:15,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {56279#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56275#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:15,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {56283#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56279#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:15,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {56287#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56283#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:15,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {56291#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56287#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:15,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56291#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:15,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-08 10:09:15,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-08 10:09:15,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-08 10:09:15,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-08 10:09:15,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56070#true} is VALID [2022-04-08 10:09:15,298 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-08 10:09:15,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194063429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:15,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:15,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:09:15,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974799568] [2022-04-08 10:09:15,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974799568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:15,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:15,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:09:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923691755] [2022-04-08 10:09:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:15,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:15,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:15,325 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-08 10:09:15,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:09:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:09:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:09:15,326 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:26,442 INFO L93 Difference]: Finished difference Result 603 states and 863 transitions. [2022-04-08 10:09:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:09:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 233 transitions. [2022-04-08 10:09:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 233 transitions. [2022-04-08 10:09:26,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 233 transitions. [2022-04-08 10:09:26,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:26,644 INFO L225 Difference]: With dead ends: 603 [2022-04-08 10:09:26,644 INFO L226 Difference]: Without dead ends: 571 [2022-04-08 10:09:26,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:09:26,645 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 200 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3441 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:26,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 219 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3441 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 10:09:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-08 10:09:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 279. [2022-04-08 10:09:27,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:27,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:27,777 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:27,778 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:27,787 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2022-04-08 10:09:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 731 transitions. [2022-04-08 10:09:27,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:27,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:27,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-08 10:09:27,788 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-08 10:09:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:27,797 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2022-04-08 10:09:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 731 transitions. [2022-04-08 10:09:27,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:27,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:27,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:27,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 371 transitions. [2022-04-08 10:09:27,802 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 371 transitions. Word has length 33 [2022-04-08 10:09:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:27,802 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 371 transitions. [2022-04-08 10:09:27,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-08 10:09:27,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 371 transitions. [2022-04-08 10:09:29,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2022-04-08 10:09:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:09:29,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:29,121 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:29,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:29,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-08 10:09:29,323 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1633078978, now seen corresponding path program 17 times [2022-04-08 10:09:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:29,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566168601] [2022-04-08 10:09:29,326 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:29,327 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1633078978, now seen corresponding path program 18 times [2022-04-08 10:09:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997897479] [2022-04-08 10:09:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:29,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-08 10:09:29,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-08 10:09:29,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-08 10:09:29,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:29,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-08 10:09:29,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-08 10:09:29,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-08 10:09:29,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-08 10:09:29,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59261#(= main_~y~0 0)} is VALID [2022-04-08 10:09:29,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {59261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:29,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {59262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:29,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {59263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:29,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {59264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:29,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {59265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:29,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {59266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:29,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:29,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {59268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:29,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {59268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:29,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:29,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:29,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:29,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:29,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:29,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:29,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:29,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:29,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:29,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:29,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:29,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:29,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:29,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:29,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-08 10:09:29,653 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-08 10:09:29,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-08 10:09:29,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-08 10:09:29,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-08 10:09:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:29,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997897479] [2022-04-08 10:09:29,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997897479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:29,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505963140] [2022-04-08 10:09:29,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:29,655 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:29,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:09:29,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:09:29,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:29,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:09:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:29,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:30,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59256#true} is VALID [2022-04-08 10:09:30,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-08 10:09:30,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-08 10:09:30,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-08 10:09:30,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-08 10:09:30,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59256#true} is VALID [2022-04-08 10:09:30,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {59256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:30,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:30,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:30,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:30,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:30,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:30,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:30,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:30,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:30,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:30,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {59257#false} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-08 10:09:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:09:30,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:30,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-08 10:09:30,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-08 10:09:30,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-08 10:09:30,241 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-08 10:09:30,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {59257#false} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-08 10:09:30,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-08 10:09:30,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:30,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:30,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:30,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:30,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:30,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:30,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:09:30,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:30,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:30,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:30,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:30,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {59256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:30,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59256#true} is VALID [2022-04-08 10:09:30,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-08 10:09:30,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-08 10:09:30,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-08 10:09:30,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-08 10:09:30,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59256#true} is VALID [2022-04-08 10:09:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:09:30,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505963140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:30,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:30,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:09:30,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:30,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566168601] [2022-04-08 10:09:30,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566168601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:30,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:30,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:09:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703144124] [2022-04-08 10:09:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:30,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:30,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:30,287 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-08 10:09:30,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:09:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:09:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:09:30,288 INFO L87 Difference]: Start difference. First operand 279 states and 371 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:38,998 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2022-04-08 10:09:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-08 10:09:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-08 10:09:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-08 10:09:39,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 247 transitions. [2022-04-08 10:09:39,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:39,218 INFO L225 Difference]: With dead ends: 426 [2022-04-08 10:09:39,218 INFO L226 Difference]: Without dead ends: 411 [2022-04-08 10:09:39,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=455, Invalid=7201, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:09:39,219 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 100 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:39,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 115 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:09:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-08 10:09:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 288. [2022-04-08 10:09:40,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:40,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,437 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,438 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,443 INFO L93 Difference]: Finished difference Result 411 states and 520 transitions. [2022-04-08 10:09:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 520 transitions. [2022-04-08 10:09:40,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-08 10:09:40,444 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-08 10:09:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,449 INFO L93 Difference]: Finished difference Result 411 states and 520 transitions. [2022-04-08 10:09:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 520 transitions. [2022-04-08 10:09:40,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:40,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2022-04-08 10:09:40,454 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 34 [2022-04-08 10:09:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:40,454 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2022-04-08 10:09:40,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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-08 10:09:40,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 380 transitions. [2022-04-08 10:09:41,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2022-04-08 10:09:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:09:41,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:41,576 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:41,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-08 10:09:41,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:41,777 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 17 times [2022-04-08 10:09:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:41,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258153213] [2022-04-08 10:09:41,779 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:41,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 18 times [2022-04-08 10:09:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40600033] [2022-04-08 10:09:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:41,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-08 10:09:41,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-08 10:09:41,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-08 10:09:41,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:41,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-08 10:09:41,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-08 10:09:41,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-08 10:09:41,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-08 10:09:41,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61868#(= main_~y~0 0)} is VALID [2022-04-08 10:09:41,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {61868#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:41,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:41,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:41,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:41,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:41,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:41,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:41,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:41,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:41,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:41,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61878#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {61878#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-08 10:09:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:09:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40600033] [2022-04-08 10:09:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40600033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020714593] [2022-04-08 10:09:42,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:42,003 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:42,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:09:42,089 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:09:42,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:42,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:09:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:42,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:42,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61863#true} is VALID [2022-04-08 10:09:42,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-08 10:09:42,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-08 10:09:42,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-08 10:09:42,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-08 10:09:42,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61868#(= main_~y~0 0)} is VALID [2022-04-08 10:09:42,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {61868#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:42,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:42,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:42,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:42,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:42,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:42,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:42,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:42,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:42,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61931#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {61931#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-08 10:09:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:09:42,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:42,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-08 10:09:42,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-08 10:09:42,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {62031#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-08 10:09:42,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {62035#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62031#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:42,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {62039#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62035#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:42,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {62039#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:42,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:42,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {62050#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:42,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {62054#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62050#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:42,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {62058#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62054#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:42,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {62062#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62058#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:42,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {62066#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62062#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:42,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {62070#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62066#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:42,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {62074#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62070#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:42,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62074#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:42,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-08 10:09:42,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-08 10:09:42,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-08 10:09:42,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-08 10:09:42,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61863#true} is VALID [2022-04-08 10:09:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:09:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020714593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:42,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:09:42,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258153213] [2022-04-08 10:09:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258153213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:42,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:09:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937582331] [2022-04-08 10:09:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:09:42,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:42,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:42,695 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-08 10:09:42,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:09:42,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:42,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:09:42,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:09:42,696 INFO L87 Difference]: Start difference. First operand 288 states and 380 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:48,062 INFO L93 Difference]: Finished difference Result 437 states and 565 transitions. [2022-04-08 10:09:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:09:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:09:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-08 10:09:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-08 10:09:48,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2022-04-08 10:09:48,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:48,157 INFO L225 Difference]: With dead ends: 437 [2022-04-08 10:09:48,157 INFO L226 Difference]: Without dead ends: 420 [2022-04-08 10:09:48,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:09:48,158 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:48,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:09:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-08 10:09:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 288. [2022-04-08 10:09:49,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:49,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,374 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,375 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:49,380 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2022-04-08 10:09:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 547 transitions. [2022-04-08 10:09:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:49,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:49,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-08 10:09:49,383 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-08 10:09:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:49,389 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2022-04-08 10:09:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 547 transitions. [2022-04-08 10:09:49,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:49,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:49,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:49,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 379 transitions. [2022-04-08 10:09:49,393 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 379 transitions. Word has length 34 [2022-04-08 10:09:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:49,393 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 379 transitions. [2022-04-08 10:09:49,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 379 transitions. [2022-04-08 10:09:50,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 379 transitions. [2022-04-08 10:09:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:09:50,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:50,591 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:50,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:50,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 10:09:50,805 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1290423902, now seen corresponding path program 19 times [2022-04-08 10:09:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:50,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305218242] [2022-04-08 10:09:50,809 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:50,809 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1290423902, now seen corresponding path program 20 times [2022-04-08 10:09:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447983541] [2022-04-08 10:09:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:50,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:50,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-08 10:09:50,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-08 10:09:50,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64418#(= main_~y~0 0)} is VALID [2022-04-08 10:09:50,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {64418#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:50,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:50,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:50,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:50,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:51,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:51,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:51,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:51,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:51,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:51,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64428#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {64428#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,004 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-08 10:09:51,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-08 10:09:51,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-08 10:09:51,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-08 10:09:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:09:51,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447983541] [2022-04-08 10:09:51,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447983541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954504781] [2022-04-08 10:09:51,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:51,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:51,005 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:51,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:09:51,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:51,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:51,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:09:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:51,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:51,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64413#true} is VALID [2022-04-08 10:09:51,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-08 10:09:51,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-08 10:09:51,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-08 10:09:51,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-08 10:09:51,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64418#(= main_~y~0 0)} is VALID [2022-04-08 10:09:51,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {64418#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:51,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:51,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:51,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:51,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:51,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:51,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:51,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:51,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:51,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:51,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:51,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {64481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-08 10:09:51,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-08 10:09:51,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-08 10:09:51,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-08 10:09:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:09:51,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:51,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-08 10:09:51,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {64581#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-08 10:09:51,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {64585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64581#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:51,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {64585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:51,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:51,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {64596#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:51,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {64600#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64596#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:51,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {64604#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64600#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:51,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {64608#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64604#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:51,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {64612#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64608#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:51,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {64616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64612#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:51,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {64620#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:51,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {64624#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64620#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:51,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64624#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:51,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-08 10:09:51,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-08 10:09:51,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-08 10:09:51,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-08 10:09:51,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64413#true} is VALID [2022-04-08 10:09:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:09:51,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954504781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:51,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:51,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:09:51,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:51,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305218242] [2022-04-08 10:09:51,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305218242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:51,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:51,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:09:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447543443] [2022-04-08 10:09:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:51,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:09:51,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:51,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:51,590 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-08 10:09:51,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:09:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:09:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:09:51,591 INFO L87 Difference]: Start difference. First operand 288 states and 379 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:57,389 INFO L93 Difference]: Finished difference Result 465 states and 597 transitions. [2022-04-08 10:09:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:09:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:09:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 10:09:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 10:09:57,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-08 10:09:57,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:57,491 INFO L225 Difference]: With dead ends: 465 [2022-04-08 10:09:57,491 INFO L226 Difference]: Without dead ends: 448 [2022-04-08 10:09:57,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:09:57,492 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 96 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:57,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 112 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:09:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-04-08 10:09:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 288. [2022-04-08 10:09:58,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:58,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,706 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,706 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:58,712 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2022-04-08 10:09:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 579 transitions. [2022-04-08 10:09:58,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:58,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:58,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 448 states. [2022-04-08 10:09:58,713 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 448 states. [2022-04-08 10:09:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:58,719 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2022-04-08 10:09:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 579 transitions. [2022-04-08 10:09:58,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:58,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:58,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:58,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 378 transitions. [2022-04-08 10:09:58,725 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 378 transitions. Word has length 34 [2022-04-08 10:09:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:58,725 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 378 transitions. [2022-04-08 10:09:58,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:58,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 378 transitions. [2022-04-08 10:09:59,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 378 transitions. [2022-04-08 10:09:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:09:59,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:59,876 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:59,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-08 10:10:00,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-08 10:10:00,077 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2073808990, now seen corresponding path program 35 times [2022-04-08 10:10:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:00,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584122326] [2022-04-08 10:10:00,085 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:00,085 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2073808990, now seen corresponding path program 36 times [2022-04-08 10:10:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884798975] [2022-04-08 10:10:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:00,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:00,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-08 10:10:00,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-08 10:10:00,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67076#(= main_~y~0 0)} is VALID [2022-04-08 10:10:00,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {67076#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:00,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:00,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:00,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:00,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:00,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:00,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:00,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:00,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:00,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:00,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:00,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:00,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:00,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:00,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:00,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:00,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:00,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:00,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:00,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {67095#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:10:00,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {67095#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-08 10:10:00,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-08 10:10:00,466 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-08 10:10:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884798975] [2022-04-08 10:10:00,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884798975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070644340] [2022-04-08 10:10:00,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:00,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:00,467 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:00,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:10:00,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:10:00,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:00,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:10:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:00,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:00,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67071#true} is VALID [2022-04-08 10:10:00,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-08 10:10:00,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-08 10:10:00,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-08 10:10:00,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-08 10:10:00,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67076#(= main_~y~0 0)} is VALID [2022-04-08 10:10:00,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {67076#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:00,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:00,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:00,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:00,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:00,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:00,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:00,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:00,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:00,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:00,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:00,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:00,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:00,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:00,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:00,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:00,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:00,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:00,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:00,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {67175#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {67175#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-08 10:10:00,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-08 10:10:00,996 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-08 10:10:00,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:01,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-08 10:10:01,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-08 10:10:01,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-08 10:10:01,668 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-08 10:10:01,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:01,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:01,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:01,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {67221#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-08 10:10:01,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {67225#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {67221#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:01,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {67225#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:01,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {67232#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:01,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {67236#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67232#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:01,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {67240#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67236#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:01,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {67244#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67240#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:01,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {67248#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67244#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:01,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {67252#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67248#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:01,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {67256#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67252#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:01,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {67260#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67256#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:01,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {67264#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67260#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:01,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {67268#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67264#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:01,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {67272#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67268#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:01,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {67276#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67272#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:01,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {67280#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67276#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:01,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {67284#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67280#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:01,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {67288#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67284#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:01,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {67292#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67288#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:01,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {67296#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67292#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:01,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {67300#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67296#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:01,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67300#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:10:01,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-08 10:10:01,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-08 10:10:01,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-08 10:10:01,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-08 10:10:01,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67071#true} is VALID [2022-04-08 10:10:01,682 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-08 10:10:01,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070644340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:01,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:01,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:10:01,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:01,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584122326] [2022-04-08 10:10:01,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584122326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:01,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:01,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:10:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238398949] [2022-04-08 10:10:01,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:01,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:01,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:01,706 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-08 10:10:01,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:10:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:10:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:10:01,707 INFO L87 Difference]: Start difference. First operand 288 states and 378 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,317 INFO L93 Difference]: Finished difference Result 679 states and 971 transitions. [2022-04-08 10:10:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:10:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 245 transitions. [2022-04-08 10:10:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 245 transitions. [2022-04-08 10:10:15,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 245 transitions. [2022-04-08 10:10:15,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:15,537 INFO L225 Difference]: With dead ends: 679 [2022-04-08 10:10:15,537 INFO L226 Difference]: Without dead ends: 647 [2022-04-08 10:10:15,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:10:15,538 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 211 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3842 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:15,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 231 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3842 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:10:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-04-08 10:10:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 301. [2022-04-08 10:10:16,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:16,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:16,808 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:16,808 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:16,821 INFO L93 Difference]: Finished difference Result 647 states and 834 transitions. [2022-04-08 10:10:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2022-04-08 10:10:16,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:16,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:16,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 647 states. [2022-04-08 10:10:16,822 INFO L87 Difference]: Start difference. First operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 647 states. [2022-04-08 10:10:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:16,839 INFO L93 Difference]: Finished difference Result 647 states and 834 transitions. [2022-04-08 10:10:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2022-04-08 10:10:16,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:16,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:16,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:16,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2022-04-08 10:10:16,846 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 34 [2022-04-08 10:10:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:16,846 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2022-04-08 10:10:16,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-08 10:10:16,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 301 states and 397 transitions. [2022-04-08 10:10:17,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2022-04-08 10:10:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:10:17,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:17,973 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:17,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:18,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 10:10:18,173 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 991978272, now seen corresponding path program 19 times [2022-04-08 10:10:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:18,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620865925] [2022-04-08 10:10:18,176 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:18,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 991978272, now seen corresponding path program 20 times [2022-04-08 10:10:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079807037] [2022-04-08 10:10:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:18,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-08 10:10:18,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-08 10:10:18,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70620#(= main_~y~0 0)} is VALID [2022-04-08 10:10:18,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {70620#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70621#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:18,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {70621#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70622#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:18,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {70622#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70623#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:18,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {70623#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70624#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:18,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {70624#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70625#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:18,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {70625#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70626#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:18,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {70626#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:18,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:18,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {70628#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:18,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {70628#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70629#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:18,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {70629#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70630#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:18,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {70630#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70631#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:18,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {70631#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70632#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {70632#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70633#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {70633#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {70616#false} assume !(~y~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {70616#false} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-08 10:10:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:10:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:18,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079807037] [2022-04-08 10:10:18,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079807037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:18,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868655727] [2022-04-08 10:10:18,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:18,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:18,439 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:18,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:10:18,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:18,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:18,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:10:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:18,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-08 10:10:18,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-08 10:10:18,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-08 10:10:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:10:18,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:18,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-08 10:10:18,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:18,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:18,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:18,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:18,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:18,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:18,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-08 10:10:18,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-08 10:10:18,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70615#true} is VALID [2022-04-08 10:10:18,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-08 10:10:18,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-08 10:10:18,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-08 10:10:18,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-08 10:10:18,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70615#true} is VALID [2022-04-08 10:10:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:10:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868655727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:18,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 23 [2022-04-08 10:10:18,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620865925] [2022-04-08 10:10:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620865925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:10:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557025755] [2022-04-08 10:10:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:10:18,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:18,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-08 10:10:18,849 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-08 10:10:18,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:10:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:10:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:10:18,849 INFO L87 Difference]: Start difference. First operand 301 states and 397 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-08 10:10:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:25,018 INFO L93 Difference]: Finished difference Result 449 states and 583 transitions. [2022-04-08 10:10:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:10:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:10:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-08 10:10:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-08 10:10:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-08 10:10:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-08 10:10:25,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-08 10:10:25,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:25,125 INFO L225 Difference]: With dead ends: 449 [2022-04-08 10:10:25,125 INFO L226 Difference]: Without dead ends: 410 [2022-04-08 10:10:25,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:10:25,127 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:25,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 123 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:10:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-08 10:10:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 302. [2022-04-08 10:10:26,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:26,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,451 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,451 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:26,459 INFO L93 Difference]: Finished difference Result 410 states and 540 transitions. [2022-04-08 10:10:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-04-08 10:10:26,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:26,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:26,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-08 10:10:26,460 INFO L87 Difference]: Start difference. First operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-08 10:10:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:26,469 INFO L93 Difference]: Finished difference Result 410 states and 540 transitions. [2022-04-08 10:10:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-04-08 10:10:26,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:26,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:26,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:26,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 396 transitions. [2022-04-08 10:10:26,475 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 396 transitions. Word has length 35 [2022-04-08 10:10:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:26,476 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 396 transitions. [2022-04-08 10:10:26,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-08 10:10:26,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 302 states and 396 transitions. [2022-04-08 10:10:28,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 396 transitions. [2022-04-08 10:10:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:10:28,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:28,182 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:28,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:28,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:28,382 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1717478545, now seen corresponding path program 37 times [2022-04-08 10:10:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379143056] [2022-04-08 10:10:28,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:28,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1717478545, now seen corresponding path program 38 times [2022-04-08 10:10:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:28,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140912857] [2022-04-08 10:10:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:28,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-08 10:10:28,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-08 10:10:28,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-08 10:10:28,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:28,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-08 10:10:28,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-08 10:10:28,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-08 10:10:28,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-08 10:10:28,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73229#(= main_~y~0 0)} is VALID [2022-04-08 10:10:28,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {73229#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:28,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:28,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:28,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:28,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:28,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:28,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:28,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:28,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:28,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:28,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:28,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:28,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:28,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:28,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:28,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:28,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:28,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:28,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:28,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:28,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {73249#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:28,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {73249#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:28,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:28,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:28,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:28,829 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-08 10:10:28,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-08 10:10:28,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-08 10:10:28,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-08 10:10:28,829 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-08 10:10:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:28,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140912857] [2022-04-08 10:10:28,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140912857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:28,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147401114] [2022-04-08 10:10:28,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:28,831 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:10:28,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:28,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:28,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:10:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:28,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:29,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73224#true} is VALID [2022-04-08 10:10:29,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-08 10:10:29,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-08 10:10:29,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-08 10:10:29,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-08 10:10:29,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73229#(= main_~y~0 0)} is VALID [2022-04-08 10:10:29,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {73229#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:29,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:29,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:29,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:29,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:29,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:29,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:29,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:29,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:29,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:29,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:29,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:29,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:29,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:29,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:29,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:29,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:29,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:29,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:29,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:29,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {73332#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:10:29,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {73332#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-08 10:10:29,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-08 10:10:29,238 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-08 10:10:29,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:29,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-08 10:10:29,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-08 10:10:29,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-08 10:10:29,965 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-08 10:10:29,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {73378#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-08 10:10:29,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {73382#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {73378#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:29,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {73382#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {73382#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:29,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {73389#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73382#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:29,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {73393#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73389#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:29,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {73397#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73393#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:29,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {73401#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73397#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:29,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {73405#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73401#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:29,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {73409#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73405#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:29,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {73413#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73409#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:29,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {73417#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73413#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:29,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {73421#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73417#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:29,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {73425#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73421#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:29,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {73429#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73425#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:29,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {73433#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73429#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:29,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {73437#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73433#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:29,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {73441#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73437#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:29,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {73445#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73441#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:29,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {73449#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73445#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:29,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {73453#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73449#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:29,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {73457#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73453#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:29,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {73461#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73457#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:10:29,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73461#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:29,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-08 10:10:29,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-08 10:10:29,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-08 10:10:29,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-08 10:10:29,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73224#true} is VALID [2022-04-08 10:10:29,981 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-08 10:10:29,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147401114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:29,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:29,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:10:29,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:29,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379143056] [2022-04-08 10:10:29,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379143056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:29,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:29,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:10:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478149368] [2022-04-08 10:10:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:29,982 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:29,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:29,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:30,003 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-08 10:10:30,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:10:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:10:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:10:30,004 INFO L87 Difference]: Start difference. First operand 302 states and 396 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:44,878 INFO L93 Difference]: Finished difference Result 711 states and 1017 transitions. [2022-04-08 10:10:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:10:44,878 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-08 10:10:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-08 10:10:44,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 257 transitions. [2022-04-08 10:10:45,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:45,120 INFO L225 Difference]: With dead ends: 711 [2022-04-08 10:10:45,120 INFO L226 Difference]: Without dead ends: 679 [2022-04-08 10:10:45,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:10:45,121 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 227 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:45,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 243 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4263 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 10:10:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-04-08 10:10:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 315. [2022-04-08 10:10:46,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:46,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,440 INFO L74 IsIncluded]: Start isIncluded. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,440 INFO L87 Difference]: Start difference. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:46,452 INFO L93 Difference]: Finished difference Result 679 states and 875 transitions. [2022-04-08 10:10:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 875 transitions. [2022-04-08 10:10:46,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:46,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:46,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-08 10:10:46,453 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-08 10:10:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:46,465 INFO L93 Difference]: Finished difference Result 679 states and 875 transitions. [2022-04-08 10:10:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 875 transitions. [2022-04-08 10:10:46,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:46,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:46,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:46,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 415 transitions. [2022-04-08 10:10:46,470 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 415 transitions. Word has length 35 [2022-04-08 10:10:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:46,470 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 415 transitions. [2022-04-08 10:10:46,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 10:10:46,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 415 transitions. [2022-04-08 10:10:47,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 415 transitions. [2022-04-08 10:10:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:10:47,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:47,845 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:47,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-08 10:10:48,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:48,059 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 9 times [2022-04-08 10:10:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:48,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557850154] [2022-04-08 10:10:48,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:48,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 10 times [2022-04-08 10:10:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:48,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943907592] [2022-04-08 10:10:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:48,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-08 10:10:48,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-08 10:10:48,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-08 10:10:48,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:48,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-08 10:10:48,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-08 10:10:48,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-08 10:10:48,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-08 10:10:48,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:48,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76940#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-08 10:10:48,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {76940#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76941#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:10:48,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {76941#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76942#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:10:48,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {76942#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:48,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:10:48,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} ~z~0 := ~y~0; {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:10:48,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:10:48,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:10:48,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:10:48,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:10:48,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:10:48,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:10:48,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:10:48,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:10:48,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:10:48,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:10:48,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:10:48,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:10:48,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:48,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:48,622 INFO L272 TraceCheckUtils]: 32: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76950#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:10:48,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {76950#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {76951#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:10:48,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {76951#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {76935#false} is VALID [2022-04-08 10:10:48,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-08 10:10:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:10:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:48,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943907592] [2022-04-08 10:10:48,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943907592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:48,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090249926] [2022-04-08 10:10:48,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:48,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:48,625 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:48,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:10:48,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:48,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:48,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:10:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:48,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:49,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76934#true} is VALID [2022-04-08 10:10:49,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-08 10:10:49,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-08 10:10:49,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-08 10:10:49,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-08 10:10:49,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:10:49,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:10:49,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:10:49,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:49,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:49,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:49,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:10:49,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:10:49,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:10:49,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:10:49,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:10:49,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:10:49,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:49,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:10:49,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:10:49,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:10:49,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:10:49,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:10:49,025 INFO L272 TraceCheckUtils]: 32: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:10:49,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:10:49,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {77059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76935#false} is VALID [2022-04-08 10:10:49,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-08 10:10:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:10:49,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:49,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-08 10:10:49,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {77059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76935#false} is VALID [2022-04-08 10:10:49,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:10:49,465 INFO L272 TraceCheckUtils]: 32: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:10:49,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:10:49,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:10:49,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:10:49,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:10:49,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:10:49,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:10:49,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:10:49,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:10:49,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:10:49,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:10:49,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:10:49,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-08 10:10:49,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-08 10:10:49,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-08 10:10:49,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-08 10:10:49,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76934#true} is VALID [2022-04-08 10:10:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:10:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090249926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:49,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:49,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 25 [2022-04-08 10:10:49,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:49,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557850154] [2022-04-08 10:10:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557850154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:49,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:49,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:10:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398327601] [2022-04-08 10:10:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:49,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:10:49,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:49,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-08 10:10:49,530 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-08 10:10:49,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:10:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:10:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:10:49,531 INFO L87 Difference]: Start difference. First operand 315 states and 415 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-08 10:10:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:52,350 INFO L93 Difference]: Finished difference Result 326 states and 426 transitions. [2022-04-08 10:10:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:10:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:10:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-08 10:10:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-08 10:10:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-08 10:10:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-08 10:10:52,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-08 10:10:52,412 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-08 10:10:52,416 INFO L225 Difference]: With dead ends: 326 [2022-04-08 10:10:52,416 INFO L226 Difference]: Without dead ends: 316 [2022-04-08 10:10:52,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:10:52,417 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:52,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 73 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:10:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-08 10:10:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-04-08 10:10:53,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:53,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:53,908 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:53,912 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2022-04-08 10:10:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-08 10:10:53,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:53,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:53,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-08 10:10:53,912 INFO L87 Difference]: Start difference. First operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-08 10:10:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:53,917 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2022-04-08 10:10:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-08 10:10:53,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:53,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:53,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:53,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 416 transitions. [2022-04-08 10:10:53,922 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 416 transitions. Word has length 36 [2022-04-08 10:10:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:53,922 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 416 transitions. [2022-04-08 10:10:53,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-08 10:10:53,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 416 transitions. [2022-04-08 10:10:55,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-08 10:10:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:10:55,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:55,285 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:55,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:55,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:55,485 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 9 times [2022-04-08 10:10:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406902111] [2022-04-08 10:10:55,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:55,488 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 10 times [2022-04-08 10:10:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774311141] [2022-04-08 10:10:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:55,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-08 10:10:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-08 10:10:55,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-08 10:10:55,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-08 10:10:55,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-08 10:10:55,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-08 10:10:55,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-08 10:10:55,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-08 10:10:55,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:55,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79121#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:10:55,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {79121#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79122#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:55,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {79122#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79123#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:55,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {79123#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:55,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:55,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:55,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79125#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:10:55,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {79125#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79126#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-08 10:10:55,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {79126#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79127#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:55,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {79127#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79128#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:10:55,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {79128#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:55,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:55,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:55,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:55,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-08 10:10:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774311141] [2022-04-08 10:10:55,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774311141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304627827] [2022-04-08 10:10:55,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:55,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:55,683 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:55,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 10:10:55,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:55,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:55,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:10:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:55,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:56,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79115#true} is VALID [2022-04-08 10:10:56,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-08 10:10:56,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-08 10:10:56,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-08 10:10:56,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-08 10:10:56,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-08 10:10:56,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:56,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:56,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:56,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:56,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:56,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:56,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-08 10:10:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:56,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:56,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-08 10:10:56,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-08 10:10:56,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-08 10:10:56,286 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-08 10:10:56,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-08 10:10:56,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:56,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:56,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:56,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:56,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:56,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:56,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:56,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-08 10:10:56,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-08 10:10:56,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-08 10:10:56,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-08 10:10:56,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-08 10:10:56,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79115#true} is VALID [2022-04-08 10:10:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304627827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:56,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:56,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-08 10:10:56,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:56,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406902111] [2022-04-08 10:10:56,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406902111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:56,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:56,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:10:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548828049] [2022-04-08 10:10:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:10:56,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:56,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:56,328 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-08 10:10:56,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:10:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:56,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:10:56,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:10:56,328 INFO L87 Difference]: Start difference. First operand 316 states and 416 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:00,066 INFO L93 Difference]: Finished difference Result 417 states and 568 transitions. [2022-04-08 10:11:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:11:00,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:11:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-04-08 10:11:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-04-08 10:11:00,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 95 transitions. [2022-04-08 10:11:00,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:00,187 INFO L225 Difference]: With dead ends: 417 [2022-04-08 10:11:00,188 INFO L226 Difference]: Without dead ends: 405 [2022-04-08 10:11:00,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:11:00,188 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:00,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:11:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-08 10:11:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 358. [2022-04-08 10:11:02,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:02,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,032 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,032 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,038 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2022-04-08 10:11:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 541 transitions. [2022-04-08 10:11:02,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-08 10:11:02,039 INFO L87 Difference]: Start difference. First operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-08 10:11:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,044 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2022-04-08 10:11:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 541 transitions. [2022-04-08 10:11:02,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:02,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 473 transitions. [2022-04-08 10:11:02,050 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 473 transitions. Word has length 36 [2022-04-08 10:11:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:02,050 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 473 transitions. [2022-04-08 10:11:02,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 473 transitions. [2022-04-08 10:11:04,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 473 transitions. [2022-04-08 10:11:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:11:04,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:04,054 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:04,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:04,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-08 10:11:04,255 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash -777486412, now seen corresponding path program 21 times [2022-04-08 10:11:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [563818573] [2022-04-08 10:11:04,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:04,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash -777486412, now seen corresponding path program 22 times [2022-04-08 10:11:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:04,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141907361] [2022-04-08 10:11:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-08 10:11:04,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-08 10:11:04,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-08 10:11:04,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:04,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-08 10:11:04,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-08 10:11:04,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-08 10:11:04,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-08 10:11:04,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81736#(= main_~y~0 0)} is VALID [2022-04-08 10:11:04,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {81736#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81737#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:04,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {81737#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81738#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:04,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {81738#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81739#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:04,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {81739#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81740#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:04,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {81740#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81741#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:04,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {81741#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81742#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:04,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {81742#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:04,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:04,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {81744#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:04,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {81744#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81745#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:04,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {81745#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81746#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:04,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {81746#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:04,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {81747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:04,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {81748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:04,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {81749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81750#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:11:04,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {81750#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {81732#false} assume !(~y~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {81732#false} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,547 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-08 10:11:04,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-08 10:11:04,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-08 10:11:04,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-08 10:11:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:11:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:04,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141907361] [2022-04-08 10:11:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141907361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:04,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980833361] [2022-04-08 10:11:04,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:04,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:04,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:04,552 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:04,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 10:11:04,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:04,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:04,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:11:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:04,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81731#true} is VALID [2022-04-08 10:11:04,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-08 10:11:04,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-08 10:11:04,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-08 10:11:04,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-08 10:11:04,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81731#true} is VALID [2022-04-08 10:11:04,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81731#true} is VALID [2022-04-08 10:11:04,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:04,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:04,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:04,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:04,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:04,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:04,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:04,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:04,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:04,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:04,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:04,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:04,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:04,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-08 10:11:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:11:04,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:04,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-08 10:11:04,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-08 10:11:04,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-08 10:11:04,993 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-08 10:11:04,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-08 10:11:04,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:04,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:04,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:04,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:04,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:05,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:05,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:05,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:05,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:05,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:05,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:05,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:05,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:05,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:05,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81731#true} is VALID [2022-04-08 10:11:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:11:05,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980833361] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:05,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:05,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:11:05,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:05,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [563818573] [2022-04-08 10:11:05,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [563818573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:05,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:05,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:11:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621617248] [2022-04-08 10:11:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 36 [2022-04-08 10:11:05,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:05,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-08 10:11:05,027 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-08 10:11:05,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:11:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:11:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:11:05,027 INFO L87 Difference]: Start difference. First operand 358 states and 473 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-08 10:11:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:11,973 INFO L93 Difference]: Finished difference Result 476 states and 623 transitions. [2022-04-08 10:11:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:11:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 36 [2022-04-08 10:11:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-08 10:11:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 123 transitions. [2022-04-08 10:11:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-08 10:11:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 123 transitions. [2022-04-08 10:11:11,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 123 transitions. [2022-04-08 10:11:12,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:12,093 INFO L225 Difference]: With dead ends: 476 [2022-04-08 10:11:12,093 INFO L226 Difference]: Without dead ends: 461 [2022-04-08 10:11:12,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:11:12,094 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 73 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:12,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 108 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-08 10:11:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 359. [2022-04-08 10:11:13,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:13,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:13,859 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:13,859 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:13,867 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2022-04-08 10:11:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 606 transitions. [2022-04-08 10:11:13,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:13,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:13,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 10:11:13,867 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 10:11:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:13,874 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2022-04-08 10:11:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 606 transitions. [2022-04-08 10:11:13,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:13,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:13,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:13,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 474 transitions. [2022-04-08 10:11:13,881 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 474 transitions. Word has length 36 [2022-04-08 10:11:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:13,881 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 474 transitions. [2022-04-08 10:11:13,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-08 10:11:13,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 474 transitions. [2022-04-08 10:11:15,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 474 transitions. [2022-04-08 10:11:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:11:15,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:15,711 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:15,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:15,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-08 10:11:15,912 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 21 times [2022-04-08 10:11:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:15,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1359181331] [2022-04-08 10:11:15,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:15,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 22 times [2022-04-08 10:11:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:15,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984263173] [2022-04-08 10:11:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:16,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:16,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-08 10:11:16,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-08 10:11:16,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84631#(= main_~y~0 0)} is VALID [2022-04-08 10:11:16,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {84631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:16,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:16,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:16,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:16,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:16,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:16,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:16,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:16,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:16,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:16,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:16,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84642#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {84642#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-08 10:11:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:11:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:16,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984263173] [2022-04-08 10:11:16,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984263173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:16,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963253611] [2022-04-08 10:11:16,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:16,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:16,113 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:16,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 10:11:16,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:16,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:16,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:11:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:16,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:16,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84626#true} is VALID [2022-04-08 10:11:16,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-08 10:11:16,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-08 10:11:16,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-08 10:11:16,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-08 10:11:16,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84631#(= main_~y~0 0)} is VALID [2022-04-08 10:11:16,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {84631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:16,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:16,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:16,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:16,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:16,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:16,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:16,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:16,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:16,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:16,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:16,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {84698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-08 10:11:16,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-08 10:11:16,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-08 10:11:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:11:16,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:16,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-08 10:11:16,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-08 10:11:16,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-08 10:11:16,747 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-08 10:11:16,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-08 10:11:16,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {84804#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-08 10:11:16,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {84808#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84804#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:16,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {84812#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84808#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:16,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {84812#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:16,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:16,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {84823#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:16,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {84827#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84823#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:16,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {84831#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84827#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:16,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {84835#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84831#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:16,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {84839#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84835#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:16,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {84843#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84839#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:16,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {84847#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84843#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:16,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {84851#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84847#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:16,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84851#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:16,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-08 10:11:16,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-08 10:11:16,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-08 10:11:16,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-08 10:11:16,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84626#true} is VALID [2022-04-08 10:11:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:11:16,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963253611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:16,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:16,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:11:16,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:16,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1359181331] [2022-04-08 10:11:16,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1359181331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:16,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:16,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:11:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301334235] [2022-04-08 10:11:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:11:16,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:16,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:16,798 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-08 10:11:16,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:11:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:11:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:11:16,799 INFO L87 Difference]: Start difference. First operand 359 states and 474 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:23,724 INFO L93 Difference]: Finished difference Result 533 states and 683 transitions. [2022-04-08 10:11:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:11:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:11:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-08 10:11:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-08 10:11:23,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 121 transitions. [2022-04-08 10:11:23,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:23,841 INFO L225 Difference]: With dead ends: 533 [2022-04-08 10:11:23,842 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 10:11:23,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:11:23,842 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:23,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 111 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:11:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 10:11:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 359. [2022-04-08 10:11:25,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:25,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:25,647 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:25,648 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:25,656 INFO L93 Difference]: Finished difference Result 515 states and 664 transitions. [2022-04-08 10:11:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 664 transitions. [2022-04-08 10:11:25,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:25,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:25,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 10:11:25,657 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 10:11:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:25,664 INFO L93 Difference]: Finished difference Result 515 states and 664 transitions. [2022-04-08 10:11:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 664 transitions. [2022-04-08 10:11:25,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:25,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:25,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:25,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 473 transitions. [2022-04-08 10:11:25,670 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 473 transitions. Word has length 36 [2022-04-08 10:11:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:25,670 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 473 transitions. [2022-04-08 10:11:25,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:25,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 473 transitions. [2022-04-08 10:11:27,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 473 transitions. [2022-04-08 10:11:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:11:27,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:27,561 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:27,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:27,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-08 10:11:27,761 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2043557906, now seen corresponding path program 23 times [2022-04-08 10:11:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797660263] [2022-04-08 10:11:27,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:27,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2043557906, now seen corresponding path program 24 times [2022-04-08 10:11:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:27,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154288053] [2022-04-08 10:11:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:27,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:27,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-08 10:11:27,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-08 10:11:27,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87721#(= main_~y~0 0)} is VALID [2022-04-08 10:11:27,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {87721#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:27,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {87722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:27,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {87723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:27,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {87724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:27,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {87725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:27,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {87726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:27,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {87727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:27,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {87728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87729#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:27,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {87729#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:27,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:27,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {87731#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {87731#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87732#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {87732#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-08 10:11:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:11:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:27,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154288053] [2022-04-08 10:11:27,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154288053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:27,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044870155] [2022-04-08 10:11:27,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:27,947 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:27,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 10:11:28,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:11:28,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:28,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:11:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:28,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:28,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {87716#true} assume !(~x~0 % 4294967296 > 0); {87716#true} is VALID [2022-04-08 10:11:28,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {87716#true} ~z~0 := ~y~0; {87785#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:11:28,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {87785#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87789#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:11:28,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {87789#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:11:28,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87797#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {87797#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-08 10:11:28,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-08 10:11:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-08 10:11:28,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:28,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-08 10:11:28,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-08 10:11:28,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-08 10:11:28,290 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-08 10:11:28,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {87797#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-08 10:11:28,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87797#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:28,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {87897#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {87901#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87897#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {87716#true} ~z~0 := ~y~0; {87901#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {87716#true} assume !(~x~0 % 4294967296 > 0); {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87716#true} is VALID [2022-04-08 10:11:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-08 10:11:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044870155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:28,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 21 [2022-04-08 10:11:28,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797660263] [2022-04-08 10:11:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797660263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:28,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:28,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:11:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264775349] [2022-04-08 10:11:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:11:28,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:28,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:28,315 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-08 10:11:28,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:11:28,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:28,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:11:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:11:28,316 INFO L87 Difference]: Start difference. First operand 359 states and 473 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:36,148 INFO L93 Difference]: Finished difference Result 563 states and 717 transitions. [2022-04-08 10:11:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:11:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:11:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-08 10:11:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-08 10:11:36,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-08 10:11:36,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:36,295 INFO L225 Difference]: With dead ends: 563 [2022-04-08 10:11:36,295 INFO L226 Difference]: Without dead ends: 545 [2022-04-08 10:11:36,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:11:36,295 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 107 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:36,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 129 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-04-08 10:11:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 359. [2022-04-08 10:11:38,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:38,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,089 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,089 INFO L87 Difference]: Start difference. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:38,098 INFO L93 Difference]: Finished difference Result 545 states and 698 transitions. [2022-04-08 10:11:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 698 transitions. [2022-04-08 10:11:38,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:38,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:38,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 545 states. [2022-04-08 10:11:38,099 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 545 states. [2022-04-08 10:11:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:38,108 INFO L93 Difference]: Finished difference Result 545 states and 698 transitions. [2022-04-08 10:11:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 698 transitions. [2022-04-08 10:11:38,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:38,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:38,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:38,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2022-04-08 10:11:38,114 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 36 [2022-04-08 10:11:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:38,114 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2022-04-08 10:11:38,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:38,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 472 transitions. [2022-04-08 10:11:40,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2022-04-08 10:11:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:11:40,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:40,527 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-08 10:11:40,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-08 10:11:40,727 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash 738830658, now seen corresponding path program 39 times [2022-04-08 10:11:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:40,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648872063] [2022-04-08 10:11:40,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:40,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 738830658, now seen corresponding path program 40 times [2022-04-08 10:11:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:40,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984485997] [2022-04-08 10:11:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:41,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:41,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-08 10:11:41,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-08 10:11:41,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-08 10:11:41,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:41,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-08 10:11:41,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-08 10:11:41,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-08 10:11:41,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-08 10:11:41,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90920#(= main_~y~0 0)} is VALID [2022-04-08 10:11:41,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {90920#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:41,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:41,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:41,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:41,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:41,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:41,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:41,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:41,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:41,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:41,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:41,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:41,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:41,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:41,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:41,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:41,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:41,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:41,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:41,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:41,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {90941#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {90941#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-08 10:11:41,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-08 10:11:41,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-08 10:11:41,240 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-08 10:11:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:41,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984485997] [2022-04-08 10:11:41,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984485997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:41,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112383344] [2022-04-08 10:11:41,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:41,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:41,241 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:41,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 10:11:41,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:41,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:41,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:11:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:41,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:41,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90915#true} is VALID [2022-04-08 10:11:41,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-08 10:11:41,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-08 10:11:41,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-08 10:11:41,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-08 10:11:41,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90920#(= main_~y~0 0)} is VALID [2022-04-08 10:11:41,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {90920#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:41,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:41,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:41,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:41,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:41,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:41,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:41,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:41,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:41,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:41,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:41,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:41,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:41,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:41,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:41,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:41,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:41,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:41,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:41,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:41,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:41,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {91027#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:11:41,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {91027#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-08 10:11:41,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-08 10:11:41,713 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-08 10:11:41,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:42,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-08 10:11:42,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-08 10:11:42,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-08 10:11:42,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-08 10:11:42,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:42,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:42,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:42,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {91073#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-08 10:11:42,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {91077#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {91073#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:42,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {91077#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {91077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:42,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {91084#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:42,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {91088#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91084#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:42,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {91092#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91088#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:42,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {91096#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91092#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:42,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {91100#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91096#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:42,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {91104#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91100#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:42,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {91108#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91104#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:42,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {91112#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91108#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:42,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {91116#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91112#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:42,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {91120#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91116#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:42,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {91124#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91120#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:42,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {91128#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91124#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:42,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {91132#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91128#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:42,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {91136#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91132#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:42,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {91140#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91136#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:42,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {91144#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91140#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:42,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {91148#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91144#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:42,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {91152#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91148#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:42,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {91156#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91152#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:42,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {91160#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91156#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:42,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91160#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:11:42,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-08 10:11:42,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-08 10:11:42,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-08 10:11:42,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-08 10:11:42,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90915#true} is VALID [2022-04-08 10:11:42,616 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-08 10:11:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112383344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:42,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:42,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:11:42,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648872063] [2022-04-08 10:11:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648872063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:42,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:42,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:11:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156592966] [2022-04-08 10:11:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:11:42,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:42,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:11:42,642 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-08 10:11:42,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:11:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:11:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:11:42,643 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:12:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:00,181 INFO L93 Difference]: Finished difference Result 810 states and 1162 transitions. [2022-04-08 10:12:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:12:00,181 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:12:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:12:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2022-04-08 10:12:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:12:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2022-04-08 10:12:00,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 269 transitions. [2022-04-08 10:12:00,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:00,428 INFO L225 Difference]: With dead ends: 810 [2022-04-08 10:12:00,428 INFO L226 Difference]: Without dead ends: 775 [2022-04-08 10:12:00,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:12:00,429 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 237 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:00,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 255 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:12:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-08 10:12:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 374. [2022-04-08 10:12:02,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:02,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,275 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,279 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,295 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2022-04-08 10:12:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 990 transitions. [2022-04-08 10:12:02,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 775 states. [2022-04-08 10:12:02,296 INFO L87 Difference]: Start difference. First operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 775 states. [2022-04-08 10:12:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,313 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2022-04-08 10:12:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 990 transitions. [2022-04-08 10:12:02,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:02,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 494 transitions. [2022-04-08 10:12:02,320 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 494 transitions. Word has length 36 [2022-04-08 10:12:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:02,320 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 494 transitions. [2022-04-08 10:12:02,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-08 10:12:02,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 494 transitions. [2022-04-08 10:12:04,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 494 transitions. [2022-04-08 10:12:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:12:04,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:04,787 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:04,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:04,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-08 10:12:04,987 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 11 times [2022-04-08 10:12:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:04,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424232142] [2022-04-08 10:12:04,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:04,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 12 times [2022-04-08 10:12:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349007798] [2022-04-08 10:12:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:05,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-08 10:12:05,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-08 10:12:05,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:05,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-08 10:12:05,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-08 10:12:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:12:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349007798] [2022-04-08 10:12:05,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349007798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112120153] [2022-04-08 10:12:05,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:05,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:05,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:05,099 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:05,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 10:12:05,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:12:05,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:05,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:12:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:05,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:05,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95143#true} is VALID [2022-04-08 10:12:05,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-08 10:12:05,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-08 10:12:05,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-08 10:12:05,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-08 10:12:05,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-08 10:12:05,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-08 10:12:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:12:05,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-08 10:12:05,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-08 10:12:05,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-08 10:12:05,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:05,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-08 10:12:05,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95143#true} is VALID [2022-04-08 10:12:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:12:05,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112120153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:05,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:05,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-08 10:12:05,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:05,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424232142] [2022-04-08 10:12:05,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424232142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:05,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:05,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:12:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044913503] [2022-04-08 10:12:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:12:05,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:05,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:05,717 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-08 10:12:05,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:12:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:12:05,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:12:05,717 INFO L87 Difference]: Start difference. First operand 374 states and 494 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:08,785 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2022-04-08 10:12:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:12:08,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:12:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-08 10:12:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-08 10:12:08,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2022-04-08 10:12:08,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:08,857 INFO L225 Difference]: With dead ends: 413 [2022-04-08 10:12:08,857 INFO L226 Difference]: Without dead ends: 383 [2022-04-08 10:12:08,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:12:08,857 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:08,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 65 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:12:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-08 10:12:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 359. [2022-04-08 10:12:10,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:10,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,639 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,639 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:10,644 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2022-04-08 10:12:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2022-04-08 10:12:10,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:10,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:10,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-08 10:12:10,645 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-08 10:12:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:10,649 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2022-04-08 10:12:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2022-04-08 10:12:10,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:10,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:10,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:10,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 477 transitions. [2022-04-08 10:12:10,656 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 477 transitions. Word has length 37 [2022-04-08 10:12:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:10,656 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 477 transitions. [2022-04-08 10:12:10,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 477 transitions. [2022-04-08 10:12:12,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 477 transitions. [2022-04-08 10:12:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:12:12,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:12,589 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:12,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:12,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-08 10:12:12,789 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash 203683232, now seen corresponding path program 23 times [2022-04-08 10:12:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:12,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364682820] [2022-04-08 10:12:12,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:12,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 203683232, now seen corresponding path program 24 times [2022-04-08 10:12:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:12,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237821121] [2022-04-08 10:12:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:13,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {97717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:13,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {97717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-08 10:12:13,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-08 10:12:13,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97700#(= main_~y~0 0)} is VALID [2022-04-08 10:12:13,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {97700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:13,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {97701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:13,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {97702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:13,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {97703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:13,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {97704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:13,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {97705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:13,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {97706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:13,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:13,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {97708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:13,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {97708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:13,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:13,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:13,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:12:13,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:12:13,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:12:13,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:12:13,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:12:13,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:12:13,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:12:13,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:12:13,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:13,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:13,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:13,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:13,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:13,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:13,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-08 10:12:13,121 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-08 10:12:13,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-08 10:12:13,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-08 10:12:13,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-08 10:12:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:12:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:13,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237821121] [2022-04-08 10:12:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237821121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231050589] [2022-04-08 10:12:13,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:13,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:13,123 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:13,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 10:12:13,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:12:13,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:13,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:12:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:13,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:13,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97695#true} is VALID [2022-04-08 10:12:13,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-08 10:12:13,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-08 10:12:13,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-08 10:12:13,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-08 10:12:13,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97695#true} is VALID [2022-04-08 10:12:13,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {97695#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:13,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:13,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:13,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:13,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:13,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:13,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:13,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:13,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:13,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:13,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-08 10:12:13,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {97696#false} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-08 10:12:13,569 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-08 10:12:13,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-08 10:12:13,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-08 10:12:13,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-08 10:12:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:13,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:13,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-08 10:12:13,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-08 10:12:13,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-08 10:12:13,707 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-08 10:12:13,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {97696#false} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-08 10:12:13,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-08 10:12:13,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:13,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:13,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:13,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:13,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:13,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:13,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:12:13,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:13,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:13,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:13,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:13,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {97695#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:13,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97695#true} is VALID [2022-04-08 10:12:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:13,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231050589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:13,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:13,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:12:13,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:13,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364682820] [2022-04-08 10:12:13,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364682820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:13,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:13,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:12:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310763724] [2022-04-08 10:12:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:13,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:13,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:13,748 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-08 10:12:13,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:12:13,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:13,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:12:13,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:12:13,749 INFO L87 Difference]: Start difference. First operand 359 states and 477 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:26,836 INFO L93 Difference]: Finished difference Result 541 states and 753 transitions. [2022-04-08 10:12:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-08 10:12:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 292 transitions. [2022-04-08 10:12:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 292 transitions. [2022-04-08 10:12:26,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 292 transitions. [2022-04-08 10:12:27,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:27,103 INFO L225 Difference]: With dead ends: 541 [2022-04-08 10:12:27,103 INFO L226 Difference]: Without dead ends: 525 [2022-04-08 10:12:27,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=575, Invalid=10981, Unknown=0, NotChecked=0, Total=11556 [2022-04-08 10:12:27,104 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:27,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 128 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2823 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 10:12:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-04-08 10:12:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 369. [2022-04-08 10:12:28,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:28,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:28,958 INFO L74 IsIncluded]: Start isIncluded. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:28,958 INFO L87 Difference]: Start difference. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:28,966 INFO L93 Difference]: Finished difference Result 525 states and 662 transitions. [2022-04-08 10:12:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 662 transitions. [2022-04-08 10:12:28,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:28,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:28,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 525 states. [2022-04-08 10:12:28,967 INFO L87 Difference]: Start difference. First operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 525 states. [2022-04-08 10:12:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:28,975 INFO L93 Difference]: Finished difference Result 525 states and 662 transitions. [2022-04-08 10:12:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 662 transitions. [2022-04-08 10:12:28,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:28,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:28,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:28,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 487 transitions. [2022-04-08 10:12:28,981 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 487 transitions. Word has length 37 [2022-04-08 10:12:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:28,981 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 487 transitions. [2022-04-08 10:12:28,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 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-08 10:12:28,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 369 states and 487 transitions. [2022-04-08 10:12:30,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 487 transitions. [2022-04-08 10:12:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:12:30,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:30,763 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:30,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:30,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:30,964 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -424995377, now seen corresponding path program 41 times [2022-04-08 10:12:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:30,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940659116] [2022-04-08 10:12:30,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:30,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash -424995377, now seen corresponding path program 42 times [2022-04-08 10:12:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:30,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662422666] [2022-04-08 10:12:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:31,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-08 10:12:31,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-08 10:12:31,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-08 10:12:31,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:31,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-08 10:12:31,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-08 10:12:31,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-08 10:12:31,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-08 10:12:31,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100982#(= main_~y~0 0)} is VALID [2022-04-08 10:12:31,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {100982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:31,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:31,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:31,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:31,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:31,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:31,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:31,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:31,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:31,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:31,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:31,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:31,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:31,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:31,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:31,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:31,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:31,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:31,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:31,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:12:31,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:31,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:31,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {101004#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {101004#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {100978#false} assume !(~y~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {100978#false} assume !(~x~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {100978#false} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-08 10:12:31,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-08 10:12:31,485 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-08 10:12:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662422666] [2022-04-08 10:12:31,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662422666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228914017] [2022-04-08 10:12:31,485 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:31,488 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:31,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 10:12:32,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 10:12:32,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:32,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:12:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:32,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:32,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {100977#true} is VALID [2022-04-08 10:12:32,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-08 10:12:32,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-08 10:12:32,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-08 10:12:32,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-08 10:12:32,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100982#(= main_~y~0 0)} is VALID [2022-04-08 10:12:32,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {100982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:32,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:32,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:32,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:32,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:32,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:32,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:32,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:32,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:32,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:32,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:32,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:32,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:32,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:32,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:32,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:32,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:32,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:32,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:32,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:12:32,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:32,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:12:32,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:12:32,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:12:32,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:12:32,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:12:32,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:32,646 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-08 10:12:32,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-08 10:12:32,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-08 10:12:32,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-08 10:12:32,646 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-08 10:12:32,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:33,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-08 10:12:33,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-08 10:12:33,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-08 10:12:33,547 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-08 10:12:33,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-08 10:12:33,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:33,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:33,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:33,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {101143#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:33,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {101143#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {101143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:33,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {101150#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:33,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {101154#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101150#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:33,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {101158#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101154#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:33,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {101162#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101158#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:33,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {101166#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101162#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:33,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {101170#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101166#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:33,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {101174#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101170#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:33,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {101178#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101174#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:33,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {101182#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101178#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:33,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {101186#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101182#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:33,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {101190#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101186#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:33,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {101194#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101190#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:33,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {101198#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101194#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:33,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {101202#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101198#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:33,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {101206#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101202#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:12:33,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {101210#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101206#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:12:33,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {101214#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101210#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:12:33,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {101218#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101214#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:12:33,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {101222#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101218#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:12:33,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {101226#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101222#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:33,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {101230#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101226#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:12:33,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101230#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:12:33,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-08 10:12:33,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-08 10:12:33,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-08 10:12:33,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-08 10:12:33,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {100977#true} is VALID [2022-04-08 10:12:33,563 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-08 10:12:33,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228914017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:33,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:33,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:12:33,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940659116] [2022-04-08 10:12:33,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940659116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:33,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:33,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:12:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257725198] [2022-04-08 10:12:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:33,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:33,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:33,587 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-08 10:12:33,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:12:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:12:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:12:33,588 INFO L87 Difference]: Start difference. First operand 369 states and 487 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:54,091 INFO L93 Difference]: Finished difference Result 869 states and 1242 transitions. [2022-04-08 10:12:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:12:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 277 transitions. [2022-04-08 10:12:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 277 transitions. [2022-04-08 10:12:54,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 277 transitions. [2022-04-08 10:12:54,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:54,344 INFO L225 Difference]: With dead ends: 869 [2022-04-08 10:12:54,344 INFO L226 Difference]: Without dead ends: 832 [2022-04-08 10:12:54,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:12:54,345 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 239 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5084 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 5084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:54,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 264 Invalid, 5208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 5084 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 10:12:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-04-08 10:12:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 384. [2022-04-08 10:12:56,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:56,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,289 INFO L74 IsIncluded]: Start isIncluded. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,289 INFO L87 Difference]: Start difference. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:56,308 INFO L93 Difference]: Finished difference Result 832 states and 1062 transitions. [2022-04-08 10:12:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1062 transitions. [2022-04-08 10:12:56,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:56,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:56,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 832 states. [2022-04-08 10:12:56,309 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 832 states. [2022-04-08 10:12:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:56,328 INFO L93 Difference]: Finished difference Result 832 states and 1062 transitions. [2022-04-08 10:12:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1062 transitions. [2022-04-08 10:12:56,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:56,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:56,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:56,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 509 transitions. [2022-04-08 10:12:56,334 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 509 transitions. Word has length 37 [2022-04-08 10:12:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:56,335 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 509 transitions. [2022-04-08 10:12:56,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-08 10:12:56,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 509 transitions. [2022-04-08 10:12:58,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 509 transitions. [2022-04-08 10:12:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:12:58,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:58,349 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:58,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-08 10:12:58,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:58,550 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 25 times [2022-04-08 10:12:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:58,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298380045] [2022-04-08 10:12:58,556 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:58,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 26 times [2022-04-08 10:12:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:58,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821513648] [2022-04-08 10:12:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-08 10:12:58,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-08 10:12:58,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-08 10:12:58,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:58,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-08 10:12:58,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-08 10:12:58,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-08 10:12:58,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-08 10:12:58,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105472#(= main_~y~0 0)} is VALID [2022-04-08 10:12:58,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {105472#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:58,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:58,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:58,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:58,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:58,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:58,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:58,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:58,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:58,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:58,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:58,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:58,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105484#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:58,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {105484#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:58,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {105468#false} assume !(~y~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-08 10:12:58,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {105468#false} assume !(~x~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {105468#false} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-08 10:12:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:12:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:58,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821513648] [2022-04-08 10:12:58,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821513648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:58,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420837153] [2022-04-08 10:12:58,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:58,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:58,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:58,808 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:58,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 10:12:58,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:58,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:58,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:12:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:58,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:59,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105467#true} is VALID [2022-04-08 10:12:59,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-08 10:12:59,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-08 10:12:59,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-08 10:12:59,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-08 10:12:59,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105472#(= main_~y~0 0)} is VALID [2022-04-08 10:12:59,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {105472#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:59,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:59,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:59,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:59,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:59,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:59,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:59,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:59,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:59,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:59,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:59,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:59,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:59,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:59,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:59,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:59,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:59,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105559#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:59,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {105559#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105563#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:59,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {105563#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105567#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:59,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {105567#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105571#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:59,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {105571#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~y~0 % 4294967296 > 0); {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~x~0 % 4294967296 > 0); {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:12:59,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:59,333 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-08 10:12:59,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-08 10:12:59,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-08 10:12:59,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-08 10:12:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:12:59,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:59,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-08 10:12:59,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-08 10:12:59,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-08 10:12:59,883 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-08 10:12:59,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-08 10:12:59,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {105637#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:59,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {105641#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105637#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:12:59,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {105645#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105641#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:12:59,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {105649#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105645#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:12:59,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105649#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:12:59,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:59,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:12:59,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:59,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:12:59,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:12:59,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:59,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:12:59,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} ~z~0 := ~y~0; {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:59,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:59,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {105688#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:59,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {105692#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105688#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:59,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {105696#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105692#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:59,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {105700#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105696#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:59,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {105704#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105700#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:59,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {105708#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105704#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:59,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {105712#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105708#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:59,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {105716#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105712#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:59,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105716#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:59,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-08 10:12:59,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-08 10:12:59,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-08 10:12:59,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-08 10:12:59,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105467#true} is VALID [2022-04-08 10:12:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:12:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420837153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:59,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 40 [2022-04-08 10:12:59,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298380045] [2022-04-08 10:12:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298380045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:59,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:12:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526301882] [2022-04-08 10:12:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:12:59,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:59,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:59,919 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-08 10:12:59,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:12:59,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:12:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:12:59,920 INFO L87 Difference]: Start difference. First operand 384 states and 509 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:08,188 INFO L93 Difference]: Finished difference Result 561 states and 726 transitions. [2022-04-08 10:13:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:13:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-08 10:13:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-08 10:13:08,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 121 transitions. [2022-04-08 10:13:08,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:08,313 INFO L225 Difference]: With dead ends: 561 [2022-04-08 10:13:08,313 INFO L226 Difference]: Without dead ends: 542 [2022-04-08 10:13:08,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=586, Invalid=2836, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:13:08,314 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 87 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:08,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 110 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:13:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-08 10:13:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 384. [2022-04-08 10:13:10,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:10,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:10,263 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:10,263 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:10,272 INFO L93 Difference]: Finished difference Result 542 states and 706 transitions. [2022-04-08 10:13:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 706 transitions. [2022-04-08 10:13:10,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:10,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:10,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-08 10:13:10,273 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-08 10:13:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:10,282 INFO L93 Difference]: Finished difference Result 542 states and 706 transitions. [2022-04-08 10:13:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 706 transitions. [2022-04-08 10:13:10,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:10,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:10,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:10,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2022-04-08 10:13:10,289 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 38 [2022-04-08 10:13:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:10,289 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2022-04-08 10:13:10,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:10,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 508 transitions. [2022-04-08 10:13:12,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2022-04-08 10:13:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:13:12,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:12,413 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:12,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:12,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:12,613 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1924187202, now seen corresponding path program 25 times [2022-04-08 10:13:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:12,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710678929] [2022-04-08 10:13:12,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:12,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1924187202, now seen corresponding path program 26 times [2022-04-08 10:13:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:12,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37982819] [2022-04-08 10:13:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:12,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-08 10:13:12,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-08 10:13:12,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-08 10:13:12,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:12,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-08 10:13:12,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-08 10:13:12,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-08 10:13:12,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-08 10:13:12,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108754#(= main_~y~0 0)} is VALID [2022-04-08 10:13:12,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {108754#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108755#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:12,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {108755#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108756#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:12,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {108756#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108757#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:12,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {108757#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108758#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:12,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {108758#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:12,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {108759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108760#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:12,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {108760#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108761#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:12,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {108761#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:12,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:12,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {108763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:12,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {108763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:12,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {108764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:12,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {108765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:12,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {108766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:12,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {108767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {108768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {108769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {108750#false} assume !(~y~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {108750#false} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-08 10:13:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:13:12,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:12,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37982819] [2022-04-08 10:13:12,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37982819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:12,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740085665] [2022-04-08 10:13:12,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:13:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:12,876 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:12,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 10:13:12,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:13:12,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:12,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:13:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:12,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:13,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108749#true} is VALID [2022-04-08 10:13:13,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-08 10:13:13,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-08 10:13:13,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:13,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:13,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:13,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:13,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:13,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:13,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:13,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:13,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:13,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:13,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:13,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:13,194 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-08 10:13:13,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-08 10:13:13,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-08 10:13:13,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-08 10:13:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:13:13,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:13,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-08 10:13:13,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-08 10:13:13,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-08 10:13:13,319 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-08 10:13:13,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:13,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-08 10:13:13,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:13,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:13,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:13,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:13,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:13,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:13,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:13,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:13,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:13,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:13,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:13,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:13,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-08 10:13:13,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-08 10:13:13,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108749#true} is VALID [2022-04-08 10:13:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:13:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740085665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:13,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:13,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-08 10:13:13,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:13,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710678929] [2022-04-08 10:13:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710678929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:13,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:13,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:13:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828162982] [2022-04-08 10:13:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:13,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:13,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-08 10:13:13,354 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-08 10:13:13,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:13:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:13:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:13:13,355 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-08 10:13:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:22,027 INFO L93 Difference]: Finished difference Result 559 states and 725 transitions. [2022-04-08 10:13:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:13:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-08 10:13:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-08 10:13:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-08 10:13:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-08 10:13:22,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 135 transitions. [2022-04-08 10:13:22,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:22,164 INFO L225 Difference]: With dead ends: 559 [2022-04-08 10:13:22,164 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 10:13:22,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=2933, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:13:22,164 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 85 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:22,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 117 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:13:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 10:13:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-04-08 10:13:24,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:24,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:24,080 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:24,081 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:24,092 INFO L93 Difference]: Finished difference Result 515 states and 677 transitions. [2022-04-08 10:13:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 677 transitions. [2022-04-08 10:13:24,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:24,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:24,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 10:13:24,093 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 10:13:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:24,104 INFO L93 Difference]: Finished difference Result 515 states and 677 transitions. [2022-04-08 10:13:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 677 transitions. [2022-04-08 10:13:24,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:24,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:24,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:24,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 507 transitions. [2022-04-08 10:13:24,112 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 507 transitions. Word has length 38 [2022-04-08 10:13:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:24,112 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 507 transitions. [2022-04-08 10:13:24,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-08 10:13:24,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 507 transitions. [2022-04-08 10:13:26,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 507 transitions. [2022-04-08 10:13:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:13:26,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:26,193 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:26,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:26,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-08 10:13:26,395 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 27 times [2022-04-08 10:13:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390988146] [2022-04-08 10:13:26,398 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:26,398 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 28 times [2022-04-08 10:13:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:26,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483289983] [2022-04-08 10:13:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-08 10:13:26,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-08 10:13:26,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-08 10:13:26,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:26,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-08 10:13:26,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-08 10:13:26,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-08 10:13:26,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-08 10:13:26,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111990#(= main_~y~0 0)} is VALID [2022-04-08 10:13:26,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {111990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:26,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:26,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:26,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:26,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:26,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:26,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:26,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112002#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:26,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {112002#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-08 10:13:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:13:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:26,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483289983] [2022-04-08 10:13:26,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483289983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:26,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623856653] [2022-04-08 10:13:26,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:26,656 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:26,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 10:13:26,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:26,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:26,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:13:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:26,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:26,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {111985#true} is VALID [2022-04-08 10:13:26,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-08 10:13:26,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-08 10:13:26,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-08 10:13:26,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-08 10:13:26,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111990#(= main_~y~0 0)} is VALID [2022-04-08 10:13:26,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {111990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:26,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:26,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:26,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:26,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:26,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:26,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:26,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:26,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:26,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:26,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:13:26,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:13:26,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112061#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:26,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {112061#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:26,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-08 10:13:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:13:26,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-08 10:13:27,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-08 10:13:27,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {112173#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-08 10:13:27,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {112177#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112173#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:27,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {112181#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112177#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:27,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {112181#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:27,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:27,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {112192#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:13:27,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {112196#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112192#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:13:27,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {112200#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:27,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {112204#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112200#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:27,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {112208#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112204#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:27,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {112212#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112208#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:27,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {112216#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112212#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:27,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {112220#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112216#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:27,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {112224#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {112220#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:27,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {112224#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:27,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-08 10:13:27,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-08 10:13:27,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-08 10:13:27,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-08 10:13:27,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {111985#true} is VALID [2022-04-08 10:13:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:13:27,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623856653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:27,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:27,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:13:27,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:27,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390988146] [2022-04-08 10:13:27,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390988146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:27,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:27,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:13:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543528736] [2022-04-08 10:13:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:27,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:27,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:27,387 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-08 10:13:27,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:13:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:13:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:13:27,388 INFO L87 Difference]: Start difference. First operand 385 states and 507 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:36,476 INFO L93 Difference]: Finished difference Result 593 states and 760 transitions. [2022-04-08 10:13:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:13:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-08 10:13:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-08 10:13:36,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 128 transitions. [2022-04-08 10:13:36,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:36,599 INFO L225 Difference]: With dead ends: 593 [2022-04-08 10:13:36,599 INFO L226 Difference]: Without dead ends: 574 [2022-04-08 10:13:36,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:13:36,600 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:36,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 125 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:13:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-08 10:13:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 385. [2022-04-08 10:13:38,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:38,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,567 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,567 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:38,580 INFO L93 Difference]: Finished difference Result 574 states and 740 transitions. [2022-04-08 10:13:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 740 transitions. [2022-04-08 10:13:38,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:38,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:38,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 574 states. [2022-04-08 10:13:38,582 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 574 states. [2022-04-08 10:13:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:38,592 INFO L93 Difference]: Finished difference Result 574 states and 740 transitions. [2022-04-08 10:13:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 740 transitions. [2022-04-08 10:13:38,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:38,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:38,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:38,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 506 transitions. [2022-04-08 10:13:38,600 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 506 transitions. Word has length 38 [2022-04-08 10:13:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:38,600 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 506 transitions. [2022-04-08 10:13:38,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:38,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 506 transitions. [2022-04-08 10:13:41,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 506 transitions. [2022-04-08 10:13:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:13:41,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:41,254 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:41,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:41,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-04-08 10:13:41,454 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1857399070, now seen corresponding path program 29 times [2022-04-08 10:13:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:41,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1136028107] [2022-04-08 10:13:41,457 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:41,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1857399070, now seen corresponding path program 30 times [2022-04-08 10:13:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:41,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870009822] [2022-04-08 10:13:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:41,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-08 10:13:41,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-08 10:13:41,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-08 10:13:41,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:41,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-08 10:13:41,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-08 10:13:41,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-08 10:13:41,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-08 10:13:41,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115386#(= main_~y~0 0)} is VALID [2022-04-08 10:13:41,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {115386#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:41,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {115387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:41,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {115388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:41,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {115389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115390#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:41,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {115390#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115391#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:41,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {115391#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115392#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:41,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {115392#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115393#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:41,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {115393#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115394#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:41,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {115394#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115395#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:41,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {115395#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:41,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:41,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {115397#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:13:41,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {115397#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115398#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:41,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {115398#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-08 10:13:41,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-08 10:13:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:13:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:41,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870009822] [2022-04-08 10:13:41,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870009822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:41,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106746388] [2022-04-08 10:13:41,675 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:41,677 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:41,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 10:13:41,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:13:41,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:41,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:13:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:41,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:41,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115381#true} is VALID [2022-04-08 10:13:41,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:41,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {115381#true} assume !(~x~0 % 4294967296 > 0); {115381#true} is VALID [2022-04-08 10:13:41,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {115381#true} ~z~0 := ~y~0; {115454#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:13:41,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {115454#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115458#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:13:41,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {115458#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115466#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {115466#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-08 10:13:41,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-08 10:13:41,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-08 10:13:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:13:41,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:42,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-08 10:13:42,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-08 10:13:42,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-08 10:13:42,084 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {115466#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-08 10:13:42,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115466#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:13:42,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {115572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:13:42,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {115576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {115381#true} ~z~0 := ~y~0; {115576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {115381#true} assume !(~x~0 % 4294967296 > 0); {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115381#true} is VALID [2022-04-08 10:13:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:13:42,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106746388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:42,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:42,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2022-04-08 10:13:42,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1136028107] [2022-04-08 10:13:42,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1136028107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:42,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:42,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:13:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823212363] [2022-04-08 10:13:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:42,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:42,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:42,117 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-08 10:13:42,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:13:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:13:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:13:42,118 INFO L87 Difference]: Start difference. First operand 385 states and 506 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:52,099 INFO L93 Difference]: Finished difference Result 625 states and 796 transitions. [2022-04-08 10:13:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:13:52,100 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-08 10:13:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-08 10:13:52,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 136 transitions. [2022-04-08 10:13:52,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:52,224 INFO L225 Difference]: With dead ends: 625 [2022-04-08 10:13:52,224 INFO L226 Difference]: Without dead ends: 606 [2022-04-08 10:13:52,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:13:52,225 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:52,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 138 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:13:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-04-08 10:13:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 385. [2022-04-08 10:13:54,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:54,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,152 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,152 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:54,162 INFO L93 Difference]: Finished difference Result 606 states and 776 transitions. [2022-04-08 10:13:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 776 transitions. [2022-04-08 10:13:54,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:54,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:54,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 606 states. [2022-04-08 10:13:54,163 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 606 states. [2022-04-08 10:13:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:54,173 INFO L93 Difference]: Finished difference Result 606 states and 776 transitions. [2022-04-08 10:13:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 776 transitions. [2022-04-08 10:13:54,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:54,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:54,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:54,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 505 transitions. [2022-04-08 10:13:54,181 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 505 transitions. Word has length 38 [2022-04-08 10:13:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:54,181 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 505 transitions. [2022-04-08 10:13:54,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 505 transitions. [2022-04-08 10:13:56,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 505 transitions. [2022-04-08 10:13:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:13:56,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:56,062 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:56,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:56,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:56,262 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2143864094, now seen corresponding path program 43 times [2022-04-08 10:13:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:56,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729955368] [2022-04-08 10:13:56,265 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:56,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2143864094, now seen corresponding path program 44 times [2022-04-08 10:13:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411079556] [2022-04-08 10:13:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:56,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-08 10:13:56,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-08 10:13:56,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-08 10:13:56,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:56,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-08 10:13:56,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-08 10:13:56,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-08 10:13:56,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-08 10:13:56,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118898#(= main_~y~0 0)} is VALID [2022-04-08 10:13:56,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {118898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:56,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:56,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:56,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:56,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:56,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:56,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:56,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:56,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:56,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:56,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:56,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:56,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:56,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:56,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:56,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:56,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:56,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:56,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:56,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:56,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:56,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:56,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:56,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {118921#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:56,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {118921#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:56,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {118894#false} assume !(~y~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:56,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {118894#false} assume !(~x~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:56,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {118894#false} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:56,793 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-08 10:13:56,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-08 10:13:56,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-08 10:13:56,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-08 10:13:56,793 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-08 10:13:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411079556] [2022-04-08 10:13:56,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411079556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098443058] [2022-04-08 10:13:56,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:13:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:56,795 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:56,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 10:13:56,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:13:56,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:56,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:13:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:56,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:57,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118893#true} is VALID [2022-04-08 10:13:57,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-08 10:13:57,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-08 10:13:57,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-08 10:13:57,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-08 10:13:57,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118898#(= main_~y~0 0)} is VALID [2022-04-08 10:13:57,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {118898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:57,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:57,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:57,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:57,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:57,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:57,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:57,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:57,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:57,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:57,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:57,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:57,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:57,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:57,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:57,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:57,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:57,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:57,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:57,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:57,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:57,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:57,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:13:57,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:13:57,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~y~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:13:57,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~x~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:13:57,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:57,242 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-08 10:13:57,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-08 10:13:57,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-08 10:13:57,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-08 10:13:57,243 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-08 10:13:57,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:58,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-08 10:13:58,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-08 10:13:58,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-08 10:13:58,197 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-08 10:13:58,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-08 10:13:58,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:58,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:58,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:58,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {119063#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:58,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {119063#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {119063#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:58,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {119070#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119063#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:58,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {119074#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119070#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:58,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {119078#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119074#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:58,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {119082#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119078#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:58,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {119086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119082#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:58,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {119090#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {119094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119090#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:58,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {119098#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {119102#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119098#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:58,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {119106#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119102#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:58,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {119110#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119106#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:58,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {119114#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119110#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:58,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {119118#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119114#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:58,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {119122#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119118#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:13:58,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {119126#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119122#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:13:58,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {119130#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119126#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:13:58,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {119134#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119130#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:13:58,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {119138#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119134#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:13:58,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {119142#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119138#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:13:58,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {119146#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119142#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:58,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {119150#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119146#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:13:58,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {119154#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119150#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:13:58,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119154#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:13:58,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-08 10:13:58,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-08 10:13:58,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-08 10:13:58,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-08 10:13:58,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118893#true} is VALID [2022-04-08 10:13:58,214 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-08 10:13:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098443058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:58,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:58,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:13:58,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729955368] [2022-04-08 10:13:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729955368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:58,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:58,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:13:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113979012] [2022-04-08 10:13:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:13:58,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:58,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:13:58,237 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-08 10:13:58,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:13:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:13:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:13:58,238 INFO L87 Difference]: Start difference. First operand 385 states and 505 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:14:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:20,106 INFO L93 Difference]: Finished difference Result 905 states and 1291 transitions. [2022-04-08 10:14:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:14:20,107 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:14:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:14:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 289 transitions. [2022-04-08 10:14:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:14:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 289 transitions. [2022-04-08 10:14:20,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 289 transitions. [2022-04-08 10:14:20,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:20,379 INFO L225 Difference]: With dead ends: 905 [2022-04-08 10:14:20,379 INFO L226 Difference]: Without dead ends: 868 [2022-04-08 10:14:20,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:14:20,379 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 249 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 5696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:20,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 276 Invalid, 5696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 5569 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:14:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-08 10:14:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 400. [2022-04-08 10:14:22,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:22,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,368 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,368 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:22,388 INFO L93 Difference]: Finished difference Result 868 states and 1105 transitions. [2022-04-08 10:14:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1105 transitions. [2022-04-08 10:14:22,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:22,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:22,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-08 10:14:22,390 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-08 10:14:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:22,414 INFO L93 Difference]: Finished difference Result 868 states and 1105 transitions. [2022-04-08 10:14:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1105 transitions. [2022-04-08 10:14:22,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:22,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:22,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:22,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 527 transitions. [2022-04-08 10:14:22,422 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 527 transitions. Word has length 38 [2022-04-08 10:14:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:22,422 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 527 transitions. [2022-04-08 10:14:22,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-08 10:14:22,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 527 transitions. [2022-04-08 10:14:24,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 527 transitions. [2022-04-08 10:14:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:14:24,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:24,526 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:24,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:24,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:24,727 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2045746160, now seen corresponding path program 27 times [2022-04-08 10:14:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:24,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225828583] [2022-04-08 10:14:24,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:24,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2045746160, now seen corresponding path program 28 times [2022-04-08 10:14:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:24,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886611904] [2022-04-08 10:14:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-08 10:14:25,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-08 10:14:25,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-08 10:14:25,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:25,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-08 10:14:25,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-08 10:14:25,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-08 10:14:25,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-08 10:14:25,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123574#(= main_~y~0 0)} is VALID [2022-04-08 10:14:25,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {123574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:25,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {123575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:25,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {123576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:25,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {123577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:25,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {123578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:25,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {123579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:25,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {123580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:25,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {123581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:25,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:25,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {123583#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:25,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {123583#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123584#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:25,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {123584#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:25,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {123585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123586#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:25,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {123586#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:25,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {123587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:14:25,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {123588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {123589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {123590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {123570#false} assume !(~y~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {123570#false} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-08 10:14:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:14:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:25,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886611904] [2022-04-08 10:14:25,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886611904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:25,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802991922] [2022-04-08 10:14:25,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:25,018 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:25,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 10:14:25,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:25,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:25,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:14:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:25,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123569#true} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123569#true} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:25,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:25,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:25,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:25,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:25,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:25,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:25,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:25,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:25,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:25,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-08 10:14:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:14:25,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:25,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-08 10:14:25,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-08 10:14:25,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-08 10:14:25,541 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-08 10:14:25,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-08 10:14:25,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:14:25,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:25,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:25,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:25,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:25,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:25,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:14:25,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:14:25,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:14:25,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:14:25,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:14:25,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:14:25,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123569#true} is VALID [2022-04-08 10:14:25,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123569#true} is VALID [2022-04-08 10:14:25,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-08 10:14:25,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-08 10:14:25,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-08 10:14:25,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-08 10:14:25,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123569#true} is VALID [2022-04-08 10:14:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:14:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802991922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:25,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:25,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:14:25,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225828583] [2022-04-08 10:14:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225828583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:25,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:25,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:14:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007200396] [2022-04-08 10:14:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:14:25,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:25,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-08 10:14:25,577 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-08 10:14:25,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:14:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:14:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:14:25,577 INFO L87 Difference]: Start difference. First operand 400 states and 527 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-08 10:14:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:35,049 INFO L93 Difference]: Finished difference Result 547 states and 716 transitions. [2022-04-08 10:14:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:14:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:14:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-08 10:14:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-08 10:14:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-08 10:14:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-08 10:14:35,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 134 transitions. [2022-04-08 10:14:35,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:35,165 INFO L225 Difference]: With dead ends: 547 [2022-04-08 10:14:35,165 INFO L226 Difference]: Without dead ends: 531 [2022-04-08 10:14:35,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=3610, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:14:35,166 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 84 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:35,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 142 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:14:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-04-08 10:14:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 401. [2022-04-08 10:14:37,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:37,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,177 INFO L74 IsIncluded]: Start isIncluded. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,178 INFO L87 Difference]: Start difference. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:37,186 INFO L93 Difference]: Finished difference Result 531 states and 698 transitions. [2022-04-08 10:14:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 698 transitions. [2022-04-08 10:14:37,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:37,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:37,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 531 states. [2022-04-08 10:14:37,187 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 531 states. [2022-04-08 10:14:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:37,195 INFO L93 Difference]: Finished difference Result 531 states and 698 transitions. [2022-04-08 10:14:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 698 transitions. [2022-04-08 10:14:37,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:37,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:37,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:37,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 528 transitions. [2022-04-08 10:14:37,202 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 528 transitions. Word has length 39 [2022-04-08 10:14:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:37,202 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 528 transitions. [2022-04-08 10:14:37,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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-08 10:14:37,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 528 transitions. [2022-04-08 10:14:39,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 528 transitions. [2022-04-08 10:14:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:14:39,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:39,251 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:39,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:39,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-08 10:14:39,451 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 405780527, now seen corresponding path program 45 times [2022-04-08 10:14:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423355818] [2022-04-08 10:14:39,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:39,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 405780527, now seen corresponding path program 46 times [2022-04-08 10:14:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911690207] [2022-04-08 10:14:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:39,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-08 10:14:39,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-08 10:14:39,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-08 10:14:39,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:39,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-08 10:14:39,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-08 10:14:39,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-08 10:14:39,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-08 10:14:39,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126866#(= main_~y~0 0)} is VALID [2022-04-08 10:14:39,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {126866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:39,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:39,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:39,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:39,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:39,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:39,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:39,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:39,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:39,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:39,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:39,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:39,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:39,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:39,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:39,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:39,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:39,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:39,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:39,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:39,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:39,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:14:39,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:39,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:39,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {126890#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {126890#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-08 10:14:39,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-08 10:14:39,947 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-08 10:14:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911690207] [2022-04-08 10:14:39,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911690207] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135036004] [2022-04-08 10:14:39,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:39,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:39,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:39,949 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:39,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 10:14:39,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:39,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:39,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:14:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:40,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:40,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126861#true} is VALID [2022-04-08 10:14:40,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-08 10:14:40,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-08 10:14:40,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-08 10:14:40,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-08 10:14:40,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126866#(= main_~y~0 0)} is VALID [2022-04-08 10:14:40,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {126866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:40,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:40,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:40,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:40,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:40,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:40,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:40,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:40,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:40,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:40,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:40,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:40,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:40,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:40,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:40,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:40,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:40,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:40,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:40,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:40,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:14:40,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:40,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:14:40,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {126985#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {126985#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-08 10:14:40,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-08 10:14:40,400 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-08 10:14:40,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:41,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:41,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {127031#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-08 10:14:41,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {127035#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {127031#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:41,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {127035#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {127035#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:41,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {127042#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127035#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:41,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {127046#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127042#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:41,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {127050#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127046#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:41,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {127054#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127050#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:41,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {127058#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127054#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:41,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {127062#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127058#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {127066#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127062#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:41,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {127070#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127066#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {127074#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127070#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:14:41,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {127078#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127074#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:14:41,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {127082#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127078#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:14:41,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {127086#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127082#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:14:41,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {127090#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127086#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:14:41,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {127094#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127090#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:14:41,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {127098#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127094#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:14:41,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {127102#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127098#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:14:41,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {127106#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127102#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:14:41,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {127110#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127106#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:14:41,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {127114#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127110#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:14:41,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {127118#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127114#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {127122#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127118#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:14:41,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {127126#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127122#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:14:41,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {127130#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127126#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:14:41,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127130#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-08 10:14:41,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-08 10:14:41,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-08 10:14:41,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-08 10:14:41,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126861#true} is VALID [2022-04-08 10:14:41,461 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-08 10:14:41,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135036004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:41,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:41,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 10:14:41,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:41,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423355818] [2022-04-08 10:14:41,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423355818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:41,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:41,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:14:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864896226] [2022-04-08 10:14:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:14:41,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:41,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:14:41,485 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-08 10:14:41,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:14:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:41,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:14:41,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:14:41,486 INFO L87 Difference]: Start difference. First operand 401 states and 528 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:15:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:05,042 INFO L93 Difference]: Finished difference Result 941 states and 1345 transitions. [2022-04-08 10:15:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:15:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:15:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:15:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2022-04-08 10:15:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:15:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2022-04-08 10:15:05,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 301 transitions. [2022-04-08 10:15:05,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:05,318 INFO L225 Difference]: With dead ends: 941 [2022-04-08 10:15:05,318 INFO L226 Difference]: Without dead ends: 904 [2022-04-08 10:15:05,319 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:15:05,319 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 265 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6074 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 6074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:05,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 288 Invalid, 6210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 6074 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 10:15:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-04-08 10:15:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 416. [2022-04-08 10:15:07,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:07,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:07,404 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:07,404 INFO L87 Difference]: Start difference. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:07,425 INFO L93 Difference]: Finished difference Result 904 states and 1153 transitions. [2022-04-08 10:15:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1153 transitions. [2022-04-08 10:15:07,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:07,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:07,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 904 states. [2022-04-08 10:15:07,426 INFO L87 Difference]: Start difference. First operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 904 states. [2022-04-08 10:15:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:07,447 INFO L93 Difference]: Finished difference Result 904 states and 1153 transitions. [2022-04-08 10:15:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1153 transitions. [2022-04-08 10:15:07,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:07,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:07,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:07,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 550 transitions. [2022-04-08 10:15:07,455 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 550 transitions. Word has length 39 [2022-04-08 10:15:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:07,455 INFO L478 AbstractCegarLoop]: Abstraction has 416 states and 550 transitions. [2022-04-08 10:15:07,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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-08 10:15:07,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 416 states and 550 transitions. [2022-04-08 10:15:09,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 550 transitions. [2022-04-08 10:15:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:15:09,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:09,905 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:09,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-08 10:15:10,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-08 10:15:10,106 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 11 times [2022-04-08 10:15:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:10,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133789299] [2022-04-08 10:15:10,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:10,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 12 times [2022-04-08 10:15:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:10,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783862333] [2022-04-08 10:15:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:10,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-08 10:15:10,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-08 10:15:10,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-08 10:15:10,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:10,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-08 10:15:10,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-08 10:15:10,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-08 10:15:10,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-08 10:15:10,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-08 10:15:10,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131729#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:15:10,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {131729#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131730#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {131730#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131731#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {131731#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131732#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {131732#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:15:10,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:15:10,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:15:10,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131734#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:15:10,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {131734#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131735#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-08 10:15:10,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {131735#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131736#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-08 10:15:10,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {131736#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131737#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:15:10,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {131737#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131738#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:15:10,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {131738#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:15:10,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-08 10:15:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783862333] [2022-04-08 10:15:10,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783862333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:10,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205861207] [2022-04-08 10:15:10,321 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:15:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:10,322 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:10,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 10:15:10,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:15:10,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:10,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:15:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:10,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:10,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131723#true} is VALID [2022-04-08 10:15:10,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-08 10:15:10,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-08 10:15:10,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-08 10:15:10,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-08 10:15:10,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-08 10:15:10,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:15:10,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:15:10,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:15:10,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:15:10,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-08 10:15:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:10,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-08 10:15:10,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-08 10:15:10,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:15:10,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:15:10,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:15:10,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:15:10,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:15:10,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:15:10,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:15:10,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131723#true} is VALID [2022-04-08 10:15:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:10,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205861207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:10,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:10,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-08 10:15:10,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133789299] [2022-04-08 10:15:10,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133789299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:10,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:10,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:15:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192245145] [2022-04-08 10:15:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:10,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:15:10,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:10,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:10,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:10,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:15:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:10,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:15:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:15:10,947 INFO L87 Difference]: Start difference. First operand 416 states and 550 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:16,280 INFO L93 Difference]: Finished difference Result 535 states and 730 transitions. [2022-04-08 10:15:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:15:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:15:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 107 transitions. [2022-04-08 10:15:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 107 transitions. [2022-04-08 10:15:16,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 107 transitions. [2022-04-08 10:15:16,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:16,395 INFO L225 Difference]: With dead ends: 535 [2022-04-08 10:15:16,395 INFO L226 Difference]: Without dead ends: 522 [2022-04-08 10:15:16,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:15:16,395 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:16,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 63 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:15:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-04-08 10:15:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 466. [2022-04-08 10:15:18,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:18,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,953 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,953 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:18,961 INFO L93 Difference]: Finished difference Result 522 states and 699 transitions. [2022-04-08 10:15:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2022-04-08 10:15:18,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:18,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:18,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 522 states. [2022-04-08 10:15:18,963 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 522 states. [2022-04-08 10:15:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:18,970 INFO L93 Difference]: Finished difference Result 522 states and 699 transitions. [2022-04-08 10:15:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2022-04-08 10:15:18,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:18,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:18,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:18,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 618 transitions. [2022-04-08 10:15:18,980 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 618 transitions. Word has length 40 [2022-04-08 10:15:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:18,980 INFO L478 AbstractCegarLoop]: Abstraction has 466 states and 618 transitions. [2022-04-08 10:15:18,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:18,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 618 transitions. [2022-04-08 10:15:21,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 618 transitions. [2022-04-08 10:15:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:15:21,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:21,752 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:21,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:21,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:21,953 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash -559628798, now seen corresponding path program 29 times [2022-04-08 10:15:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:21,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509606241] [2022-04-08 10:15:21,955 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:21,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -559628798, now seen corresponding path program 30 times [2022-04-08 10:15:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:21,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505333788] [2022-04-08 10:15:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-08 10:15:22,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-08 10:15:22,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-08 10:15:22,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:22,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-08 10:15:22,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-08 10:15:22,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-08 10:15:22,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-08 10:15:22,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135061#(= main_~y~0 0)} is VALID [2022-04-08 10:15:22,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {135061#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135062#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:22,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {135062#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135063#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:22,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {135063#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135064#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:22,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {135064#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135065#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:22,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {135065#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135066#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:22,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {135066#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135067#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:22,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {135067#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135068#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:22,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {135068#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:22,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:22,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {135070#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:22,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {135070#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:22,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:22,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:15:22,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:15:22,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:15:22,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:15:22,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:15:22,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:15:22,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:15:22,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:15:22,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:15:22,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:15:22,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-08 10:15:22,319 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-08 10:15:22,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-08 10:15:22,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-08 10:15:22,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-08 10:15:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:15:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:22,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505333788] [2022-04-08 10:15:22,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505333788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:22,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121822513] [2022-04-08 10:15:22,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:15:22,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:22,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:22,320 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:22,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 10:15:22,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:15:22,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:22,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 10:15:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:22,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:22,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135056#true} is VALID [2022-04-08 10:15:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-08 10:15:22,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-08 10:15:22,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-08 10:15:22,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-08 10:15:22,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135056#true} is VALID [2022-04-08 10:15:22,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {135056#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {135057#false} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-08 10:15:22,788 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-08 10:15:22,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-08 10:15:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:15:22,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:22,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-08 10:15:22,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-08 10:15:22,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-08 10:15:22,932 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-08 10:15:22,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {135057#false} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-08 10:15:22,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-08 10:15:22,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:15:22,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {135056#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135056#true} is VALID [2022-04-08 10:15:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:15:22,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121822513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:22,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:22,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-08 10:15:22,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:22,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509606241] [2022-04-08 10:15:22,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509606241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:22,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:22,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:15:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539446147] [2022-04-08 10:15:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:22,948 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:22,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:22,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:22,978 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-08 10:15:22,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:15:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:15:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:15:22,979 INFO L87 Difference]: Start difference. First operand 466 states and 618 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:42,382 INFO L93 Difference]: Finished difference Result 691 states and 961 transitions. [2022-04-08 10:15:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-08 10:15:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 370 transitions. [2022-04-08 10:15:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 370 transitions. [2022-04-08 10:15:42,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 370 transitions. [2022-04-08 10:15:42,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:42,733 INFO L225 Difference]: With dead ends: 691 [2022-04-08 10:15:42,733 INFO L226 Difference]: Without dead ends: 674 [2022-04-08 10:15:42,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=709, Invalid=16061, Unknown=0, NotChecked=0, Total=16770 [2022-04-08 10:15:42,734 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4197 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 4197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:42,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 146 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 4197 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:15:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-08 10:15:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 477. [2022-04-08 10:15:45,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:45,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:45,443 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:45,444 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:45,456 INFO L93 Difference]: Finished difference Result 674 states and 851 transitions. [2022-04-08 10:15:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 851 transitions. [2022-04-08 10:15:45,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:45,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:45,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 674 states. [2022-04-08 10:15:45,457 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 674 states. [2022-04-08 10:15:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:45,475 INFO L93 Difference]: Finished difference Result 674 states and 851 transitions. [2022-04-08 10:15:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 851 transitions. [2022-04-08 10:15:45,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:45,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:45,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:45,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2022-04-08 10:15:45,490 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 40 [2022-04-08 10:15:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:45,490 INFO L478 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2022-04-08 10:15:45,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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-08 10:15:45,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 629 transitions. [2022-04-08 10:15:48,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2022-04-08 10:15:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:15:48,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:48,522 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:48,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:48,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-08 10:15:48,722 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 31 times [2022-04-08 10:15:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:48,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511197100] [2022-04-08 10:15:48,724 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:48,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 32 times [2022-04-08 10:15:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:48,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308531837] [2022-04-08 10:15:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:48,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:48,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-08 10:15:48,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-08 10:15:48,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139216#(= main_~y~0 0)} is VALID [2022-04-08 10:15:48,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {139216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:48,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:48,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:48,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:48,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:48,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:48,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:48,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:48,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:48,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:48,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:48,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:48,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:48,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139229#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {139229#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {139212#false} assume !(~y~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {139212#false} assume !(~x~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {139212#false} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-08 10:15:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:15:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:48,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308531837] [2022-04-08 10:15:48,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308531837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:48,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132283104] [2022-04-08 10:15:48,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:15:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:48,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:48,960 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:48,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 10:15:49,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:15:49,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:49,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:15:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:49,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:49,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139211#true} is VALID [2022-04-08 10:15:49,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-08 10:15:49,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-08 10:15:49,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-08 10:15:49,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-08 10:15:49,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139216#(= main_~y~0 0)} is VALID [2022-04-08 10:15:49,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {139216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:49,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:49,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:49,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:49,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:49,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:49,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:49,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:49,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:49,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:49,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:49,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:49,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:49,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:49,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:49,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:49,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:49,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:49,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139307#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:49,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {139307#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:49,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {139311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139315#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:49,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {139315#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139319#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:15:49,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {139319#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139323#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:15:49,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {139323#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:15:49,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:49,513 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-08 10:15:49,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-08 10:15:49,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-08 10:15:49,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-08 10:15:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:15:49,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:50,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-08 10:15:50,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-08 10:15:50,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-08 10:15:50,137 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-08 10:15:50,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-08 10:15:50,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {139389#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:50,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {139393#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139389#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:15:50,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {139397#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139393#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:15:50,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {139401#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139397#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:15:50,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {139405#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139401#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:15:50,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139405#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:15:50,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:15:50,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:15:50,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:15:50,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:15:50,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:15:50,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:15:50,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:15:50,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:15:50,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:50,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {139444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:50,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {139448#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:50,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {139452#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139448#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:50,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {139456#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139452#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:50,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {139460#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139456#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:50,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {139464#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139460#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:15:50,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {139468#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139464#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:15:50,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {139472#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139468#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:15:50,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {139476#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139472#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:15:50,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139476#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:15:50,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-08 10:15:50,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-08 10:15:50,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-08 10:15:50,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-08 10:15:50,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139211#true} is VALID [2022-04-08 10:15:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:15:50,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132283104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:50,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:50,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 44 [2022-04-08 10:15:50,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:50,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511197100] [2022-04-08 10:15:50,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511197100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:50,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:50,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:15:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708190833] [2022-04-08 10:15:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:15:50,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:50,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:50,175 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-08 10:15:50,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:15:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:15:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:15:50,176 INFO L87 Difference]: Start difference. First operand 477 states and 629 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:01,498 INFO L93 Difference]: Finished difference Result 702 states and 903 transitions. [2022-04-08 10:16:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:16:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-08 10:16:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-08 10:16:01,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 132 transitions. [2022-04-08 10:16:01,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:01,630 INFO L225 Difference]: With dead ends: 702 [2022-04-08 10:16:01,630 INFO L226 Difference]: Without dead ends: 682 [2022-04-08 10:16:01,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:16:01,631 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 99 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:01,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 119 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:16:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-08 10:16:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 477. [2022-04-08 10:16:04,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:04,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:04,333 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:04,333 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:04,345 INFO L93 Difference]: Finished difference Result 682 states and 882 transitions. [2022-04-08 10:16:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 882 transitions. [2022-04-08 10:16:04,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:04,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:04,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-08 10:16:04,346 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-08 10:16:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:04,358 INFO L93 Difference]: Finished difference Result 682 states and 882 transitions. [2022-04-08 10:16:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 882 transitions. [2022-04-08 10:16:04,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:04,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:04,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:04,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 628 transitions. [2022-04-08 10:16:04,368 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 628 transitions. Word has length 40 [2022-04-08 10:16:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:04,368 INFO L478 AbstractCegarLoop]: Abstraction has 477 states and 628 transitions. [2022-04-08 10:16:04,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:04,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 628 transitions. [2022-04-08 10:16:07,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2022-04-08 10:16:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:07,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:07,492 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:07,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:07,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:07,695 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 33 times [2022-04-08 10:16:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:07,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901993416] [2022-04-08 10:16:07,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:07,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 34 times [2022-04-08 10:16:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:07,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450981114] [2022-04-08 10:16:07,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:07,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-08 10:16:07,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-08 10:16:07,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-08 10:16:07,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:07,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-08 10:16:07,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-08 10:16:07,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-08 10:16:07,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-08 10:16:07,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143264#(= main_~y~0 0)} is VALID [2022-04-08 10:16:07,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {143264#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:07,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:07,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:07,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:07,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:07,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:07,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:07,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:07,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:07,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:07,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:07,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:16:07,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:16:07,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143277#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {143277#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-08 10:16:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:16:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450981114] [2022-04-08 10:16:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450981114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994574164] [2022-04-08 10:16:07,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:16:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:07,937 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:07,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-08 10:16:07,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:16:07,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:07,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:16:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:07,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:08,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143259#true} is VALID [2022-04-08 10:16:08,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-08 10:16:08,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-08 10:16:08,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-08 10:16:08,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-08 10:16:08,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143264#(= main_~y~0 0)} is VALID [2022-04-08 10:16:08,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {143264#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:08,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:08,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:08,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:08,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:08,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:08,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:08,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:08,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:08,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:08,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:08,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:16:08,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143339#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {143339#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-08 10:16:08,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-08 10:16:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:16:08,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:08,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-08 10:16:08,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-08 10:16:08,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-08 10:16:08,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {143457#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-08 10:16:08,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {143461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143457#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:16:08,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {143465#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {143461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:16:08,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {143465#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:16:08,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:16:08,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {143476#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:16:08,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {143480#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143476#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:16:08,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {143484#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143480#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:08,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {143488#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143484#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:16:08,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {143492#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143488#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:16:08,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {143496#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143492#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:16:08,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {143500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143496#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:16:08,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {143504#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:08,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {143508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143504#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:16:08,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {143512#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:08,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143512#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:16:08,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-08 10:16:08,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-08 10:16:08,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-08 10:16:08,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-08 10:16:08,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143259#true} is VALID [2022-04-08 10:16:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:16:08,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994574164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:08,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:08,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:16:08,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901993416] [2022-04-08 10:16:08,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901993416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:08,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:08,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:16:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451556337] [2022-04-08 10:16:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:08,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:08,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:08,714 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-08 10:16:08,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:16:08,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:16:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:16:08,715 INFO L87 Difference]: Start difference. First operand 477 states and 628 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:20,926 INFO L93 Difference]: Finished difference Result 737 states and 943 transitions. [2022-04-08 10:16:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:16:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-08 10:16:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-08 10:16:20,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2022-04-08 10:16:21,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:21,068 INFO L225 Difference]: With dead ends: 737 [2022-04-08 10:16:21,068 INFO L226 Difference]: Without dead ends: 717 [2022-04-08 10:16:21,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:16:21,069 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 110 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:21,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 132 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:16:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-04-08 10:16:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 477. [2022-04-08 10:16:23,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:23,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:23,791 INFO L74 IsIncluded]: Start isIncluded. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:23,791 INFO L87 Difference]: Start difference. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:23,805 INFO L93 Difference]: Finished difference Result 717 states and 922 transitions. [2022-04-08 10:16:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 922 transitions. [2022-04-08 10:16:23,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:23,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:23,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 717 states. [2022-04-08 10:16:23,806 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 717 states. [2022-04-08 10:16:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:23,826 INFO L93 Difference]: Finished difference Result 717 states and 922 transitions. [2022-04-08 10:16:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 922 transitions. [2022-04-08 10:16:23,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:23,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:23,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:23,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 627 transitions. [2022-04-08 10:16:23,838 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 627 transitions. Word has length 40 [2022-04-08 10:16:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:23,838 INFO L478 AbstractCegarLoop]: Abstraction has 477 states and 627 transitions. [2022-04-08 10:16:23,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:23,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 627 transitions. [2022-04-08 10:16:26,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 627 transitions. [2022-04-08 10:16:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:26,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:26,934 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:26,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-04-08 10:16:27,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:27,135 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 920459602, now seen corresponding path program 35 times [2022-04-08 10:16:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:27,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1133150859] [2022-04-08 10:16:27,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:27,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 920459602, now seen corresponding path program 36 times [2022-04-08 10:16:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:27,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778082149] [2022-04-08 10:16:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:27,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-08 10:16:27,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-08 10:16:27,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-08 10:16:27,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:27,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-08 10:16:27,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-08 10:16:27,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-08 10:16:27,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-08 10:16:27,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147434#(= main_~y~0 0)} is VALID [2022-04-08 10:16:27,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {147434#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147435#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:27,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {147435#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147436#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:27,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {147436#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147437#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:27,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {147437#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147438#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:27,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {147438#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147439#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:27,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {147439#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147440#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:27,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {147440#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147441#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:27,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {147441#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147442#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:27,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {147442#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147443#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:27,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {147443#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147444#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:27,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {147444#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:27,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:27,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {147446#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:16:27,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {147446#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147447#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:16:27,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {147447#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-08 10:16:27,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-08 10:16:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-08 10:16:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:27,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778082149] [2022-04-08 10:16:27,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778082149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:27,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742283149] [2022-04-08 10:16:27,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:27,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:27,407 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:27,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-08 10:16:27,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:16:27,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:27,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:16:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:27,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:27,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147429#true} is VALID [2022-04-08 10:16:27,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-08 10:16:27,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-08 10:16:27,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-08 10:16:27,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-08 10:16:27,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {147429#true} assume !(~x~0 % 4294967296 > 0); {147429#true} is VALID [2022-04-08 10:16:27,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {147429#true} ~z~0 := ~y~0; {147506#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:16:27,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {147506#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147510#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:16:27,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {147510#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:16:27,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147518#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:16:27,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {147518#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-08 10:16:27,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-08 10:16:27,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-08 10:16:27,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-08 10:16:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 10:16:27,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:27,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {147518#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-08 10:16:27,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147518#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:16:27,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {147630#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:16:27,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {147634#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147630#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {147429#true} ~z~0 := ~y~0; {147634#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {147429#true} assume !(~x~0 % 4294967296 > 0); {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147429#true} is VALID [2022-04-08 10:16:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 10:16:27,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742283149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:27,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:27,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-08 10:16:27,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1133150859] [2022-04-08 10:16:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1133150859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:27,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:16:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4120857] [2022-04-08 10:16:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:27,812 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:27,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:27,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:27,832 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-08 10:16:27,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:16:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:16:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:16:27,832 INFO L87 Difference]: Start difference. First operand 477 states and 627 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:41,335 INFO L93 Difference]: Finished difference Result 773 states and 984 transitions. [2022-04-08 10:16:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:16:41,335 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 147 transitions. [2022-04-08 10:16:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 147 transitions. [2022-04-08 10:16:41,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 147 transitions. [2022-04-08 10:16:41,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:41,476 INFO L225 Difference]: With dead ends: 773 [2022-04-08 10:16:41,476 INFO L226 Difference]: Without dead ends: 753 [2022-04-08 10:16:41,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:16:41,477 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:41,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 150 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:16:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-04-08 10:16:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 477. [2022-04-08 10:16:44,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:44,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,206 INFO L74 IsIncluded]: Start isIncluded. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,206 INFO L87 Difference]: Start difference. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:44,220 INFO L93 Difference]: Finished difference Result 753 states and 963 transitions. [2022-04-08 10:16:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 963 transitions. [2022-04-08 10:16:44,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:44,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:44,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 753 states. [2022-04-08 10:16:44,221 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 753 states. [2022-04-08 10:16:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:44,236 INFO L93 Difference]: Finished difference Result 753 states and 963 transitions. [2022-04-08 10:16:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 963 transitions. [2022-04-08 10:16:44,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:44,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:44,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:44,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 626 transitions. [2022-04-08 10:16:44,246 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 626 transitions. Word has length 40 [2022-04-08 10:16:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:44,247 INFO L478 AbstractCegarLoop]: Abstraction has 477 states and 626 transitions. [2022-04-08 10:16:44,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 626 transitions. [2022-04-08 10:16:47,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 626 transitions. [2022-04-08 10:16:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:47,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:47,381 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:47,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:47,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-04-08 10:16:47,581 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:47,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2135352450, now seen corresponding path program 47 times [2022-04-08 10:16:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:47,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018603923] [2022-04-08 10:16:47,584 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:47,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2135352450, now seen corresponding path program 48 times [2022-04-08 10:16:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:47,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143215838] [2022-04-08 10:16:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:48,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-08 10:16:48,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-08 10:16:48,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-08 10:16:48,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:48,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-08 10:16:48,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-08 10:16:48,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-08 10:16:48,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-08 10:16:48,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151735#(= main_~y~0 0)} is VALID [2022-04-08 10:16:48,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {151735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:48,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:48,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:48,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:48,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:48,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:48,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:48,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:48,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:48,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:48,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:48,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:48,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:48,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:48,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:48,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:48,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:48,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:48,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:48,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:48,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:48,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:48,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:48,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:48,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:48,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {151760#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {151760#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-08 10:16:48,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-08 10:16:48,123 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-08 10:16:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143215838] [2022-04-08 10:16:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143215838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284684770] [2022-04-08 10:16:48,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:48,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:48,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:48,125 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:48,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-08 10:16:48,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 10:16:48,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:48,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:16:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:48,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:49,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151730#true} is VALID [2022-04-08 10:16:49,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-08 10:16:49,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-08 10:16:49,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-08 10:16:49,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-08 10:16:49,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151735#(= main_~y~0 0)} is VALID [2022-04-08 10:16:49,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {151735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:49,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:49,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:49,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:49,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:49,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:49,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:49,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:49,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:49,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:49,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:49,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:49,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:49,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:49,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:49,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:49,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:49,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:49,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:49,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:49,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:49,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:49,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:49,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:49,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:49,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {151858#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {151858#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-08 10:16:49,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-08 10:16:49,083 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-08 10:16:49,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:50,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:50,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {151904#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-08 10:16:50,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {151908#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {151904#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:16:50,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {151908#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151908#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:50,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {151915#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151908#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:50,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {151919#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151915#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:16:50,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {151923#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151919#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:16:50,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {151927#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151923#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:16:50,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {151931#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151927#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:16:50,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {151935#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151931#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:50,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {151939#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151935#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:16:50,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {151943#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151939#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:50,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {151947#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151943#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:16:50,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {151951#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151947#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:16:50,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {151955#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151951#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:16:50,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {151959#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151955#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:16:50,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {151963#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151959#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:16:50,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {151967#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151963#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:16:50,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {151971#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151967#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:16:50,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {151975#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151971#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:16:50,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {151979#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151975#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:16:50,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {151983#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151979#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:16:50,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {151987#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151983#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:16:50,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {151991#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151987#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:50,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {151995#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151991#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:16:50,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {151999#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151995#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:16:50,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {152003#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151999#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:16:50,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {152007#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {152003#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:50,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {152007#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:16:50,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-08 10:16:50,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-08 10:16:50,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-08 10:16:50,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-08 10:16:50,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151730#true} is VALID [2022-04-08 10:16:50,197 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-08 10:16:50,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284684770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:50,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-08 10:16:50,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:50,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018603923] [2022-04-08 10:16:50,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018603923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:50,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:16:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633319566] [2022-04-08 10:16:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:16:50,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:50,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:16:50,221 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-08 10:16:50,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:16:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:16:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:16:50,222 INFO L87 Difference]: Start difference. First operand 477 states and 626 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:17:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:19,637 INFO L93 Difference]: Finished difference Result 1116 states and 1599 transitions. [2022-04-08 10:17:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:17:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:17:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:17:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-08 10:17:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:17:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-08 10:17:19,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 313 transitions. [2022-04-08 10:17:19,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:19,939 INFO L225 Difference]: With dead ends: 1116 [2022-04-08 10:17:19,939 INFO L226 Difference]: Without dead ends: 1076 [2022-04-08 10:17:19,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:17:19,940 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 276 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6602 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 6602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:19,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 300 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 6602 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 10:17:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-04-08 10:17:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 494. [2022-04-08 10:17:22,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:22,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:22,736 INFO L74 IsIncluded]: Start isIncluded. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:22,736 INFO L87 Difference]: Start difference. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:22,765 INFO L93 Difference]: Finished difference Result 1076 states and 1372 transitions. [2022-04-08 10:17:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1372 transitions. [2022-04-08 10:17:22,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:22,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:22,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1076 states. [2022-04-08 10:17:22,767 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1076 states. [2022-04-08 10:17:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:22,798 INFO L93 Difference]: Finished difference Result 1076 states and 1372 transitions. [2022-04-08 10:17:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1372 transitions. [2022-04-08 10:17:22,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:22,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:22,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:22,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 651 transitions. [2022-04-08 10:17:22,809 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 651 transitions. Word has length 40 [2022-04-08 10:17:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:22,809 INFO L478 AbstractCegarLoop]: Abstraction has 494 states and 651 transitions. [2022-04-08 10:17:22,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-08 10:17:22,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 651 transitions. [2022-04-08 10:17:26,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 651 edges. 651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 651 transitions. [2022-04-08 10:17:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:17:26,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:26,089 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:26,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:26,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:26,289 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 13 times [2022-04-08 10:17:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:26,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085248210] [2022-04-08 10:17:26,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:26,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 14 times [2022-04-08 10:17:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193375004] [2022-04-08 10:17:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:26,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-08 10:17:26,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-08 10:17:26,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-08 10:17:26,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:26,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-08 10:17:26,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-08 10:17:26,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-08 10:17:26,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-08 10:17:26,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:26,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157458#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-08 10:17:26,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {157458#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157459#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:17:26,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {157459#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157460#(and (<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 3 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} is VALID [2022-04-08 10:17:26,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {157460#(and (<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 3 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157461#(and (<= main_~x~0 (+ (* (div (+ main_~x~0 4 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:26,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {157461#(and (<= main_~x~0 (+ (* (div (+ main_~x~0 4 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:26,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:17:26,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:17:26,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-08 10:17:26,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:17:26,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:17:26,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:17:26,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:17:26,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:17:26,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:17:26,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:17:26,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-08 10:17:26,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:17:26,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:17:26,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-08 10:17:26,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:17:26,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:17:26,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:17:26,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:26,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:26,928 INFO L272 TraceCheckUtils]: 37: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157470#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:17:26,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {157470#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {157471#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:17:26,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {157471#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157453#false} is VALID [2022-04-08 10:17:26,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-08 10:17:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:17:26,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193375004] [2022-04-08 10:17:26,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193375004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256267512] [2022-04-08 10:17:26,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:26,930 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:26,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-08 10:17:26,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:26,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:26,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:17:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:26,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:27,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157452#true} is VALID [2022-04-08 10:17:27,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-08 10:17:27,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-08 10:17:27,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-08 10:17:27,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-08 10:17:27,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:17:27,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:17:27,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:27,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:27,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:27,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:17:27,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:17:27,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:17:27,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:17:27,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:27,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:17:27,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:17:27,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:17:27,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:17:27,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:17:27,432 INFO L272 TraceCheckUtils]: 37: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:17:27,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:17:27,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {157595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157453#false} is VALID [2022-04-08 10:17:27,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-08 10:17:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:17:27,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:28,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-08 10:17:28,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {157595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157453#false} is VALID [2022-04-08 10:17:28,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:17:28,079 INFO L272 TraceCheckUtils]: 37: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:17:28,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:17:28,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:17:28,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:17:28,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:17:28,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:17:28,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:17:28,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} ~z~0 := ~y~0; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:17:28,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-08 10:17:28,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:17:28,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-08 10:17:28,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-08 10:17:28,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-08 10:17:28,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-08 10:17:28,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157452#true} is VALID [2022-04-08 10:17:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:17:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256267512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:28,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:28,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 29 [2022-04-08 10:17:28,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085248210] [2022-04-08 10:17:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085248210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:28,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:28,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:17:28,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076749343] [2022-04-08 10:17:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:17:28,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:28,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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-08 10:17:28,206 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-08 10:17:28,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:17:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:17:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:17:28,207 INFO L87 Difference]: Start difference. First operand 494 states and 651 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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-08 10:17:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:32,952 INFO L93 Difference]: Finished difference Result 506 states and 663 transitions. [2022-04-08 10:17:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:17:32,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:17:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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-08 10:17:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-08 10:17:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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-08 10:17:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-08 10:17:32,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-08 10:17:33,051 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-08 10:17:33,062 INFO L225 Difference]: With dead ends: 506 [2022-04-08 10:17:33,063 INFO L226 Difference]: Without dead ends: 495 [2022-04-08 10:17:33,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 65 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=1551, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:17:33,063 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:33,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:17:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-08 10:17:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-04-08 10:17:35,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:35,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:35,949 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:35,949 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:35,957 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2022-04-08 10:17:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-08 10:17:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:35,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:35,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-08 10:17:35,959 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-08 10:17:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:35,968 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2022-04-08 10:17:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-08 10:17:35,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:35,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:35,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:35,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 652 transitions. [2022-04-08 10:17:35,981 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 652 transitions. Word has length 41 [2022-04-08 10:17:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:35,981 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 652 transitions. [2022-04-08 10:17:35,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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-08 10:17:35,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 652 transitions. [2022-04-08 10:17:39,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-08 10:17:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:17:39,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:39,771 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:39,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:39,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:39,972 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:39,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 763864160, now seen corresponding path program 31 times [2022-04-08 10:17:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:39,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468227198] [2022-04-08 10:17:39,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:39,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 763864160, now seen corresponding path program 32 times [2022-04-08 10:17:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:39,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268908609] [2022-04-08 10:17:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:40,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-08 10:17:40,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-08 10:17:40,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-08 10:17:40,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-08 10:17:40,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-08 10:17:40,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160752#(= main_~y~0 0)} is VALID [2022-04-08 10:17:40,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {160752#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:40,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {160753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:40,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {160754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:40,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {160755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:40,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {160756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:40,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {160757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:40,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {160758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:40,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {160759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:40,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {160760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:40,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:40,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {160762#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:40,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {160762#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:40,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {160763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:40,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {160764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:40,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {160765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:17:40,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {160766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:40,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {160767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:17:40,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {160768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {160769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {160748#false} assume !(~y~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {160748#false} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-08 10:17:40,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-08 10:17:40,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-08 10:17:40,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-08 10:17:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:17:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:40,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268908609] [2022-04-08 10:17:40,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268908609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:40,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084157186] [2022-04-08 10:17:40,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:40,303 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:40,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-08 10:17:40,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:40,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:40,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:17:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:40,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:40,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-08 10:17:40,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-08 10:17:40,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:40,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:40,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:40,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:40,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:40,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:40,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:40,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:40,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:40,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:40,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-08 10:17:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:17:40,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:40,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-08 10:17:40,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-08 10:17:40,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-08 10:17:40,817 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-08 10:17:40,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-08 10:17:40,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:17:40,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:40,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:40,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:40,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:40,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:40,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:17:40,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:17:40,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:17:40,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:17:40,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:17:40,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:17:40,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160747#true} is VALID [2022-04-08 10:17:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:17:40,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084157186] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:40,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:40,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 29 [2022-04-08 10:17:40,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:40,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468227198] [2022-04-08 10:17:40,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468227198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:40,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:40,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:17:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167943730] [2022-04-08 10:17:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 41 [2022-04-08 10:17:40,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:40,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-08 10:17:40,854 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-08 10:17:40,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:17:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:17:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:17:40,854 INFO L87 Difference]: Start difference. First operand 495 states and 652 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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)