/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:16:35,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:16:35,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:16:35,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:16:35,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:16:35,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:16:35,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:16:35,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:16:35,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:16:35,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:16:35,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:16:35,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:16:35,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:16:35,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:16:35,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:16:35,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:16:35,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:16:35,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:16:35,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:16:35,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:16:35,620 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:16:35,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:16:35,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:16:35,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:16:35,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:16:35,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:16:35,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:16:35,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:16:35,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:16:35,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:16:35,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:16:35,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:16:35,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:16:35,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:16:35,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:16:35,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:16:35,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:16:35,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:16:35,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:16:35,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:16:35,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:16:35,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:16:35,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:16:35,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:16:35,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:16:35,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:16:35,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:16:35,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:16:35,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:16:35,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:16:35,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:16:35,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:16:35,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:16:35,642 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:16:35,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:16:35,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:16:35,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:16:35,827 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:16:35,828 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:16:35,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-28 09:16:35,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33745d206/1730ca070c834ca8bd48b2f0ad57873e/FLAGb36cdb379 [2022-04-28 09:16:36,224 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:16:36,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-28 09:16:36,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33745d206/1730ca070c834ca8bd48b2f0ad57873e/FLAGb36cdb379 [2022-04-28 09:16:36,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33745d206/1730ca070c834ca8bd48b2f0ad57873e [2022-04-28 09:16:36,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:16:36,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:16:36,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:16:36,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:16:36,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:16:36,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04be49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36, skipping insertion in model container [2022-04-28 09:16:36,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:16:36,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:16:36,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c[322,335] [2022-04-28 09:16:36,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:16:36,807 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:16:36,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c[322,335] [2022-04-28 09:16:36,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:16:36,832 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:16:36,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36 WrapperNode [2022-04-28 09:16:36,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:16:36,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:16:36,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:16:36,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:16:36,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:16:36,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:16:36,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:16:36,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:16:36,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (1/1) ... [2022-04-28 09:16:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:16:36,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:36,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:16:36,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:16:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:16:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:16:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:16:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:16:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:16:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:16:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:16:36,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:16:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:16:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:16:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:16:36,993 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:16:36,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:16:37,097 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:16:37,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:16:37,102 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:16:37,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:16:37 BoogieIcfgContainer [2022-04-28 09:16:37,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:16:37,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:16:37,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:16:37,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:16:37,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:16:36" (1/3) ... [2022-04-28 09:16:37,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a4444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:16:37, skipping insertion in model container [2022-04-28 09:16:37,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:16:36" (2/3) ... [2022-04-28 09:16:37,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a4444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:16:37, skipping insertion in model container [2022-04-28 09:16:37,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:16:37" (3/3) ... [2022-04-28 09:16:37,125 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2022-04-28 09:16:37,134 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:16:37,139 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:16:37,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:16:37,181 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21347314, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fbc2f62 [2022-04-28 09:16:37,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:16:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:16:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:16:37,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:37,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:37,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 1 times [2022-04-28 09:16:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:37,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611389187] [2022-04-28 09:16:37,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:16:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 2 times [2022-04-28 09:16:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:37,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200867993] [2022-04-28 09:16:37,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:37,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 09:16:37,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:16:37,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 09:16:37,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:37,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 09:16:37,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:16:37,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 09:16:37,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-28 09:16:37,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {28#(= main_~x~0 0)} is VALID [2022-04-28 09:16:37,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {24#false} is VALID [2022-04-28 09:16:37,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24#false} is VALID [2022-04-28 09:16:37,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 09:16:37,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 09:16:37,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 09:16:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200867993] [2022-04-28 09:16:37,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200867993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:37,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:37,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:16:37,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611389187] [2022-04-28 09:16:37,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611389187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:37,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:37,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:16:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91537067] [2022-04-28 09:16:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:16:37,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:37,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:16:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:16:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:16:37,500 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,631 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-04-28 09:16:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:16:37,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:16:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 09:16:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 09:16:37,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 09:16:37,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,705 INFO L225 Difference]: With dead ends: 37 [2022-04-28 09:16:37,705 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:16:37,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:16:37,710 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:37,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:16:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-04-28 09:16:37,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:37,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,733 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,734 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,752 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:16:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:16:37,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:37,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:37,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:16:37,754 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:16:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,757 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:16:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:16:37,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:37,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:37,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:37,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 09:16:37,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 09:16:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:37,759 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 09:16:37,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 09:16:37,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:16:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:16:37,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:37,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:37,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:16:37,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585725, now seen corresponding path program 1 times [2022-04-28 09:16:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116707568] [2022-04-28 09:16:37,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:37,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585725, now seen corresponding path program 2 times [2022-04-28 09:16:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:37,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116484764] [2022-04-28 09:16:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:37,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-28 09:16:37,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-28 09:16:37,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-28 09:16:37,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:37,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-28 09:16:37,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-28 09:16:37,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-28 09:16:37,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret6 := main(); {172#true} is VALID [2022-04-28 09:16:37,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} ~x~0 := 0;~y~0 := 0; {172#true} is VALID [2022-04-28 09:16:37,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {177#(= main_~y~0 0)} is VALID [2022-04-28 09:16:37,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 10); {173#false} is VALID [2022-04-28 09:16:37,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {173#false} is VALID [2022-04-28 09:16:37,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} assume !(~x~0 % 4294967296 < 268435455); {173#false} is VALID [2022-04-28 09:16:37,861 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {173#false} is VALID [2022-04-28 09:16:37,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-28 09:16:37,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-28 09:16:37,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-28 09:16:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:37,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116484764] [2022-04-28 09:16:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116484764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:37,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:37,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:16:37,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:37,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116707568] [2022-04-28 09:16:37,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116707568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:37,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:37,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:16:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838895667] [2022-04-28 09:16:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:16:37,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:37,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:16:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:16:37,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:16:37,878 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,937 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 09:16:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:16:37,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:16:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:16:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:16:37,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 09:16:37,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,963 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:16:37,963 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:16:37,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:16:37,965 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:16:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:16:37,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:37,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,973 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,974 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,974 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 09:16:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 09:16:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:37,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:37,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:16:37,975 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:16:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:37,976 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 09:16:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 09:16:37,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:37,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:37,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:37,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 09:16:37,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-28 09:16:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:37,980 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 09:16:37,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:37,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 09:16:37,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 09:16:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:16:37,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:37,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:37,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:16:37,999 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 1 times [2022-04-28 09:16:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:38,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856917042] [2022-04-28 09:16:38,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:38,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:38,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 2 times [2022-04-28 09:16:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:38,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758512204] [2022-04-28 09:16:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:38,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 09:16:38,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 09:16:38,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {296#true} {296#true} #47#return; {296#true} is VALID [2022-04-28 09:16:38,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:38,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 09:16:38,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 09:16:38,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {296#true} {296#true} #47#return; {296#true} is VALID [2022-04-28 09:16:38,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {296#true} call #t~ret6 := main(); {296#true} is VALID [2022-04-28 09:16:38,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} ~x~0 := 0;~y~0 := 0; {296#true} is VALID [2022-04-28 09:16:38,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {301#(= main_~y~0 0)} is VALID [2022-04-28 09:16:38,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {302#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:38,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 10); {297#false} is VALID [2022-04-28 09:16:38,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {297#false} is VALID [2022-04-28 09:16:38,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {297#false} assume !(~x~0 % 4294967296 < 268435455); {297#false} is VALID [2022-04-28 09:16:38,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {297#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {297#false} is VALID [2022-04-28 09:16:38,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#false} ~cond := #in~cond; {297#false} is VALID [2022-04-28 09:16:38,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#false} assume 0 == ~cond; {297#false} is VALID [2022-04-28 09:16:38,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-04-28 09:16:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:38,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758512204] [2022-04-28 09:16:38,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758512204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:38,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602839281] [2022-04-28 09:16:38,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:38,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:16:38,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:38,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:38,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:16:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:38,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:38,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {296#true} is VALID [2022-04-28 09:16:38,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 09:16:38,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 09:16:38,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {296#true} {296#true} #47#return; {296#true} is VALID [2022-04-28 09:16:38,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {296#true} call #t~ret6 := main(); {296#true} is VALID [2022-04-28 09:16:38,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} ~x~0 := 0;~y~0 := 0; {322#(= main_~x~0 0)} is VALID [2022-04-28 09:16:38,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {322#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {326#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:38,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {322#(= main_~x~0 0)} is VALID [2022-04-28 09:16:38,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {322#(= main_~x~0 0)} is VALID [2022-04-28 09:16:38,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {322#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {336#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:38,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {297#false} is VALID [2022-04-28 09:16:38,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {297#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {297#false} is VALID [2022-04-28 09:16:38,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#false} ~cond := #in~cond; {297#false} is VALID [2022-04-28 09:16:38,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#false} assume 0 == ~cond; {297#false} is VALID [2022-04-28 09:16:38,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-04-28 09:16:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:38,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:38,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-04-28 09:16:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#false} assume 0 == ~cond; {297#false} is VALID [2022-04-28 09:16:38,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#false} ~cond := #in~cond; {297#false} is VALID [2022-04-28 09:16:38,424 INFO L272 TraceCheckUtils]: 11: Hoare triple {297#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {297#false} is VALID [2022-04-28 09:16:38,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {297#false} is VALID [2022-04-28 09:16:38,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {364#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:38,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:38,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:38,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:38,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} ~x~0 := 0;~y~0 := 0; {368#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:38,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {296#true} call #t~ret6 := main(); {296#true} is VALID [2022-04-28 09:16:38,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {296#true} {296#true} #47#return; {296#true} is VALID [2022-04-28 09:16:38,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 09:16:38,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 09:16:38,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {296#true} is VALID [2022-04-28 09:16:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:16:38,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602839281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:38,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:38,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2022-04-28 09:16:38,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:38,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856917042] [2022-04-28 09:16:38,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856917042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:38,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:38,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:16:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014274505] [2022-04-28 09:16:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:16:38,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:38,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:16:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:16:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:16:38,467 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:38,551 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 09:16:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:16:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:16:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:16:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:16:38,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 09:16:38,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:38,585 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:16:38,585 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:16:38,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:16:38,590 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:38,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:16:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:16:38,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:38,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,603 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,603 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:38,604 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:16:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:16:38,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:38,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:38,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:16:38,606 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:16:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:38,607 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:16:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:16:38,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:38,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:38,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:38,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 09:16:38,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-28 09:16:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:38,613 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 09:16:38,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:38,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 09:16:38,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:16:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:16:38,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:38,629 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:38,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:38,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:38,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303203, now seen corresponding path program 3 times [2022-04-28 09:16:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:38,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670481871] [2022-04-28 09:16:38,867 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:38,882 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:38,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303203, now seen corresponding path program 4 times [2022-04-28 09:16:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:38,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117186455] [2022-04-28 09:16:38,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:38,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {523#true} is VALID [2022-04-28 09:16:38,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} assume true; {523#true} is VALID [2022-04-28 09:16:38,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {523#true} {523#true} #47#return; {523#true} is VALID [2022-04-28 09:16:38,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:38,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {523#true} is VALID [2022-04-28 09:16:38,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2022-04-28 09:16:38,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #47#return; {523#true} is VALID [2022-04-28 09:16:38,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret6 := main(); {523#true} is VALID [2022-04-28 09:16:38,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {523#true} ~x~0 := 0;~y~0 := 0; {523#true} is VALID [2022-04-28 09:16:38,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {523#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {528#(= main_~y~0 0)} is VALID [2022-04-28 09:16:38,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {529#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:38,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {530#(and (<= main_~y~0 2) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:38,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(and (<= main_~y~0 2) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 10); {524#false} is VALID [2022-04-28 09:16:38,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {524#false} is VALID [2022-04-28 09:16:38,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#false} assume !(~x~0 % 4294967296 < 268435455); {524#false} is VALID [2022-04-28 09:16:38,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {524#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {524#false} is VALID [2022-04-28 09:16:38,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#false} ~cond := #in~cond; {524#false} is VALID [2022-04-28 09:16:38,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#false} assume 0 == ~cond; {524#false} is VALID [2022-04-28 09:16:38,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-04-28 09:16:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:38,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117186455] [2022-04-28 09:16:38,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117186455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:38,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191910530] [2022-04-28 09:16:38,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:38,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:38,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:38,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:16:39,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:39,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:39,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:16:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:39,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:39,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2022-04-28 09:16:39,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {523#true} is VALID [2022-04-28 09:16:39,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2022-04-28 09:16:39,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #47#return; {523#true} is VALID [2022-04-28 09:16:39,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret6 := main(); {523#true} is VALID [2022-04-28 09:16:39,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {523#true} ~x~0 := 0;~y~0 := 0; {550#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {550#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {550#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {550#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {550#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {566#(= main_~x~0 1)} is VALID [2022-04-28 09:16:39,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {566#(= main_~x~0 1)} is VALID [2022-04-28 09:16:39,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {566#(= main_~x~0 1)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:39,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:39,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {524#false} is VALID [2022-04-28 09:16:39,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-04-28 09:16:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:16:39,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:39,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-04-28 09:16:39,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {524#false} is VALID [2022-04-28 09:16:39,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:39,224 INFO L272 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:39,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 (mod main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {593#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:39,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {600#(<= 1 (mod (+ main_~x~0 1) 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {593#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:39,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {600#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(~y~0 % 4294967296 < 10); {600#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:39,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {600#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {600#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:39,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {600#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:39,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {600#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:39,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {523#true} ~x~0 := 0;~y~0 := 0; {600#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:39,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret6 := main(); {523#true} is VALID [2022-04-28 09:16:39,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #47#return; {523#true} is VALID [2022-04-28 09:16:39,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2022-04-28 09:16:39,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {523#true} is VALID [2022-04-28 09:16:39,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2022-04-28 09:16:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:16:39,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191910530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:39,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:39,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-04-28 09:16:39,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670481871] [2022-04-28 09:16:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670481871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:39,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:39,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:16:39,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169523949] [2022-04-28 09:16:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:16:39,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:39,241 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), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:16:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:16:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:16:39,256 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:39,365 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 09:16:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:16:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:16:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-28 09:16:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-28 09:16:39,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-28 09:16:39,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:39,396 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:16:39,396 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:16:39,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:16:39,397 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:39,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:16:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:16:39,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:39,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,403 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,404 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:39,405 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 09:16:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:16:39,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:39,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:39,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:16:39,406 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:16:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:39,407 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 09:16:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:16:39,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:39,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:39,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:39,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 09:16:39,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-04-28 09:16:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:39,408 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 09:16:39,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:39,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 09:16:39,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:16:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:16:39,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:39,434 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:39,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:39,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:16:39,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash 907959386, now seen corresponding path program 5 times [2022-04-28 09:16:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:39,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251488554] [2022-04-28 09:16:39,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:39,674 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:39,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 907959386, now seen corresponding path program 6 times [2022-04-28 09:16:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:39,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693033036] [2022-04-28 09:16:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:39,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-28 09:16:39,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-28 09:16:39,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {768#true} {768#true} #47#return; {768#true} is VALID [2022-04-28 09:16:39,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:39,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-28 09:16:39,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-28 09:16:39,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #47#return; {768#true} is VALID [2022-04-28 09:16:39,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret6 := main(); {768#true} is VALID [2022-04-28 09:16:39,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} ~x~0 := 0;~y~0 := 0; {768#true} is VALID [2022-04-28 09:16:39,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {773#(= main_~y~0 0)} is VALID [2022-04-28 09:16:39,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:39,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:39,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {776#(and (<= main_~y~0 3) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:39,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(and (<= main_~y~0 3) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 10); {769#false} is VALID [2022-04-28 09:16:39,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {769#false} is VALID [2022-04-28 09:16:39,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {769#false} assume !(~x~0 % 4294967296 < 268435455); {769#false} is VALID [2022-04-28 09:16:39,786 INFO L272 TraceCheckUtils]: 13: Hoare triple {769#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {769#false} is VALID [2022-04-28 09:16:39,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#false} ~cond := #in~cond; {769#false} is VALID [2022-04-28 09:16:39,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#false} assume 0 == ~cond; {769#false} is VALID [2022-04-28 09:16:39,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-28 09:16:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:39,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693033036] [2022-04-28 09:16:39,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693033036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:39,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110867702] [2022-04-28 09:16:39,788 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:39,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:39,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:39,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:16:39,832 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:16:39,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:39,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:39,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:39,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {768#true} is VALID [2022-04-28 09:16:39,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-28 09:16:39,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-28 09:16:39,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #47#return; {768#true} is VALID [2022-04-28 09:16:39,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret6 := main(); {768#true} is VALID [2022-04-28 09:16:39,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} ~x~0 := 0;~y~0 := 0; {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {796#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {815#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:39,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {815#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:39,912 INFO L272 TraceCheckUtils]: 13: Hoare triple {815#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {822#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 09:16:39,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {826#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 09:16:39,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {769#false} is VALID [2022-04-28 09:16:39,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-28 09:16:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:16:39,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:39,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-28 09:16:40,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {769#false} is VALID [2022-04-28 09:16:40,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {840#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {836#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:16:40,001 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {840#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:16:40,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#(not (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {844#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:40,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {844#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:40,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !(~y~0 % 4294967296 < 10); {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {851#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} ~x~0 := 0;~y~0 := 0; {851#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:40,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret6 := main(); {768#true} is VALID [2022-04-28 09:16:40,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #47#return; {768#true} is VALID [2022-04-28 09:16:40,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-28 09:16:40,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-28 09:16:40,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {768#true} is VALID [2022-04-28 09:16:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:16:40,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110867702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:40,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:40,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-28 09:16:40,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:40,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251488554] [2022-04-28 09:16:40,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251488554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:40,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:40,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:16:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498302983] [2022-04-28 09:16:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:40,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:16:40,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:40,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:40,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:16:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:16:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:16:40,017 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:40,161 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 09:16:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:16:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:16:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-28 09:16:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-28 09:16:40,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-28 09:16:40,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:40,184 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:16:40,184 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 09:16:40,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:16:40,185 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:40,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 09:16:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 09:16:40,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:40,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,194 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,194 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:40,196 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:16:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:16:40,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:40,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:40,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 09:16:40,197 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 09:16:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:40,198 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:16:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:16:40,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:40,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:40,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:40,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 09:16:40,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-04-28 09:16:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:40,199 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 09:16:40,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 09:16:40,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:16:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:16:40,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:40,226 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:40,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:40,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 934170243, now seen corresponding path program 7 times [2022-04-28 09:16:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384182274] [2022-04-28 09:16:40,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:40,469 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:40,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 934170243, now seen corresponding path program 8 times [2022-04-28 09:16:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927627119] [2022-04-28 09:16:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:40,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1032#true} is VALID [2022-04-28 09:16:40,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-28 09:16:40,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1032#true} {1032#true} #47#return; {1032#true} is VALID [2022-04-28 09:16:40,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:40,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1032#true} is VALID [2022-04-28 09:16:40,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-28 09:16:40,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #47#return; {1032#true} is VALID [2022-04-28 09:16:40,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret6 := main(); {1032#true} is VALID [2022-04-28 09:16:40,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} ~x~0 := 0;~y~0 := 0; {1032#true} is VALID [2022-04-28 09:16:40,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {1032#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1037#(= main_~y~0 0)} is VALID [2022-04-28 09:16:40,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1037#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:40,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:40,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:40,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {1040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1041#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} is VALID [2022-04-28 09:16:40,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1041#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} assume !(~y~0 % 4294967296 < 10); {1033#false} is VALID [2022-04-28 09:16:40,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {1033#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1033#false} is VALID [2022-04-28 09:16:40,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1033#false} assume !(~x~0 % 4294967296 < 268435455); {1033#false} is VALID [2022-04-28 09:16:40,581 INFO L272 TraceCheckUtils]: 14: Hoare triple {1033#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1033#false} is VALID [2022-04-28 09:16:40,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2022-04-28 09:16:40,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} assume 0 == ~cond; {1033#false} is VALID [2022-04-28 09:16:40,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2022-04-28 09:16:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927627119] [2022-04-28 09:16:40,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927627119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084664482] [2022-04-28 09:16:40,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:40,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:16:40,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:40,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:40,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:40,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:40,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2022-04-28 09:16:40,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1032#true} is VALID [2022-04-28 09:16:40,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-28 09:16:40,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #47#return; {1032#true} is VALID [2022-04-28 09:16:40,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret6 := main(); {1032#true} is VALID [2022-04-28 09:16:40,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} ~x~0 := 0;~y~0 := 0; {1061#(= main_~x~0 0)} is VALID [2022-04-28 09:16:40,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {1061#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1065#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:40,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1069#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 09:16:40,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1061#(= main_~x~0 0)} is VALID [2022-04-28 09:16:40,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1061#(= main_~x~0 0)} is VALID [2022-04-28 09:16:40,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1061#(= main_~x~0 0)} is VALID [2022-04-28 09:16:40,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {1061#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {1061#(= main_~x~0 0)} is VALID [2022-04-28 09:16:40,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1085#(= main_~x~0 1)} is VALID [2022-04-28 09:16:40,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1085#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {1033#false} is VALID [2022-04-28 09:16:40,712 INFO L272 TraceCheckUtils]: 14: Hoare triple {1033#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1033#false} is VALID [2022-04-28 09:16:40,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2022-04-28 09:16:40,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} assume 0 == ~cond; {1033#false} is VALID [2022-04-28 09:16:40,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2022-04-28 09:16:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:16:40,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:40,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2022-04-28 09:16:40,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {1033#false} assume 0 == ~cond; {1033#false} is VALID [2022-04-28 09:16:40,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2022-04-28 09:16:40,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {1033#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1033#false} is VALID [2022-04-28 09:16:40,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {1113#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1033#false} is VALID [2022-04-28 09:16:40,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1113#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1134#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1130#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:40,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1134#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:40,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} ~x~0 := 0;~y~0 := 0; {1117#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:40,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret6 := main(); {1032#true} is VALID [2022-04-28 09:16:40,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #47#return; {1032#true} is VALID [2022-04-28 09:16:40,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-04-28 09:16:40,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1032#true} is VALID [2022-04-28 09:16:40,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2022-04-28 09:16:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:16:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084664482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:40,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:40,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-04-28 09:16:40,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:40,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384182274] [2022-04-28 09:16:40,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384182274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:40,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:40,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:16:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241871014] [2022-04-28 09:16:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:16:40,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:40,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:40,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:40,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:16:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:16:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:16:40,890 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,055 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 09:16:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:16:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:16:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:16:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:16:41,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 09:16:41,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:41,079 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:16:41,079 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:16:41,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:16:41,080 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:41,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:16:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 09:16:41,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:41,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,090 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,090 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,090 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:16:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:16:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:41,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:41,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 20 states. [2022-04-28 09:16:41,091 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 20 states. [2022-04-28 09:16:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,091 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:16:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:16:41,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:41,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:41,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:41,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 09:16:41,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2022-04-28 09:16:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:41,092 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 09:16:41,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 09:16:41,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:16:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:16:41,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:41,109 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:41,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:41,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:41,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1746706810, now seen corresponding path program 9 times [2022-04-28 09:16:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:41,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768914990] [2022-04-28 09:16:41,326 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:41,352 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:41,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1746706810, now seen corresponding path program 10 times [2022-04-28 09:16:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423899517] [2022-04-28 09:16:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:41,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1313#true} is VALID [2022-04-28 09:16:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-04-28 09:16:41,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1313#true} {1313#true} #47#return; {1313#true} is VALID [2022-04-28 09:16:41,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1313#true} is VALID [2022-04-28 09:16:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-04-28 09:16:41,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #47#return; {1313#true} is VALID [2022-04-28 09:16:41,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret6 := main(); {1313#true} is VALID [2022-04-28 09:16:41,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#true} ~x~0 := 0;~y~0 := 0; {1313#true} is VALID [2022-04-28 09:16:41,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1318#(= main_~y~0 0)} is VALID [2022-04-28 09:16:41,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {1318#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1319#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:41,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1320#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:41,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1321#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:41,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {1321#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1322#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1323#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 5))} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {1323#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 5))} assume !(~y~0 % 4294967296 < 10); {1314#false} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {1314#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1314#false} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#false} assume !(~x~0 % 4294967296 < 268435455); {1314#false} is VALID [2022-04-28 09:16:41,456 INFO L272 TraceCheckUtils]: 15: Hoare triple {1314#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1314#false} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {1314#false} ~cond := #in~cond; {1314#false} is VALID [2022-04-28 09:16:41,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {1314#false} assume 0 == ~cond; {1314#false} is VALID [2022-04-28 09:16:41,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2022-04-28 09:16:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423899517] [2022-04-28 09:16:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423899517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696894919] [2022-04-28 09:16:41,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:41,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:41,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:16:41,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:41,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:41,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:16:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:41,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:41,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2022-04-28 09:16:41,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1313#true} is VALID [2022-04-28 09:16:41,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-04-28 09:16:41,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #47#return; {1313#true} is VALID [2022-04-28 09:16:41,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret6 := main(); {1313#true} is VALID [2022-04-28 09:16:41,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#true} ~x~0 := 0;~y~0 := 0; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {1343#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1343#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1343#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {1343#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {1343#(= main_~x~0 0)} is VALID [2022-04-28 09:16:41,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1368#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:41,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {1368#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:41,570 INFO L272 TraceCheckUtils]: 15: Hoare triple {1368#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:41,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:41,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1314#false} is VALID [2022-04-28 09:16:41,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2022-04-28 09:16:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 09:16:41,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:41,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2022-04-28 09:16:41,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {1379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1314#false} is VALID [2022-04-28 09:16:41,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:41,687 INFO L272 TraceCheckUtils]: 15: Hoare triple {1395#(<= 1 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:41,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1395#(<= 1 (mod main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {1395#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:41,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1395#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:41,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(~y~0 % 4294967296 < 10); {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#true} ~x~0 := 0;~y~0 := 0; {1402#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:41,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret6 := main(); {1313#true} is VALID [2022-04-28 09:16:41,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #47#return; {1313#true} is VALID [2022-04-28 09:16:41,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2022-04-28 09:16:41,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1313#true} is VALID [2022-04-28 09:16:41,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2022-04-28 09:16:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 09:16:41,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696894919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:41,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:41,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2022-04-28 09:16:41,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:41,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768914990] [2022-04-28 09:16:41,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768914990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:41,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:41,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:16:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598100120] [2022-04-28 09:16:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 09:16:41,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:41,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:16:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:16:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:16:41,706 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,915 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 09:16:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:16:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 09:16:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:16:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:16:41,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 09:16:41,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:41,939 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:16:41,940 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:16:41,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:16:41,940 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:41,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:16:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 09:16:41,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:41,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,949 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,949 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,950 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 09:16:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:16:41,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:41,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:41,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 09:16:41,950 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 09:16:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:41,951 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 09:16:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:16:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:41,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:41,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:41,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 09:16:41,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2022-04-28 09:16:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:41,952 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 09:16:41,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:41,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 09:16:41,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:16:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:16:41,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:41,970 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:41,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:42,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1165536611, now seen corresponding path program 11 times [2022-04-28 09:16:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202055708] [2022-04-28 09:16:42,191 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:42,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:42,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1165536611, now seen corresponding path program 12 times [2022-04-28 09:16:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:42,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436141949] [2022-04-28 09:16:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:42,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1609#true} is VALID [2022-04-28 09:16:42,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1609#true} assume true; {1609#true} is VALID [2022-04-28 09:16:42,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1609#true} {1609#true} #47#return; {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {1609#true} call ULTIMATE.init(); {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:42,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1609#true} assume true; {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1609#true} {1609#true} #47#return; {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {1609#true} call #t~ret6 := main(); {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1609#true} ~x~0 := 0;~y~0 := 0; {1609#true} is VALID [2022-04-28 09:16:42,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {1609#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1614#(= main_~y~0 0)} is VALID [2022-04-28 09:16:42,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1615#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:42,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1615#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1616#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:42,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {1616#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1617#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:42,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {1617#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1618#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 09:16:42,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {1618#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1619#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 09:16:42,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {1619#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1620#(and (<= main_~y~0 6) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:42,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(and (<= main_~y~0 6) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 10); {1610#false} is VALID [2022-04-28 09:16:42,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {1610#false} assume !(~x~0 % 4294967296 < 268435455); {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L272 TraceCheckUtils]: 16: Hoare triple {1610#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {1610#false} ~cond := #in~cond; {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#false} assume 0 == ~cond; {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#false} assume !false; {1610#false} is VALID [2022-04-28 09:16:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:42,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436141949] [2022-04-28 09:16:42,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436141949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678056970] [2022-04-28 09:16:42,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:42,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:42,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 09:16:42,345 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:16:42,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:42,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:42,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:42,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {1609#true} call ULTIMATE.init(); {1609#true} is VALID [2022-04-28 09:16:42,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {1609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1609#true} is VALID [2022-04-28 09:16:42,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1609#true} assume true; {1609#true} is VALID [2022-04-28 09:16:42,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1609#true} {1609#true} #47#return; {1609#true} is VALID [2022-04-28 09:16:42,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1609#true} call #t~ret6 := main(); {1609#true} is VALID [2022-04-28 09:16:42,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1609#true} ~x~0 := 0;~y~0 := 0; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {1640#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1640#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1640#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {1640#(= main_~x~0 0)} is VALID [2022-04-28 09:16:42,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {1640#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1668#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:42,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {1668#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {1668#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:42,427 INFO L272 TraceCheckUtils]: 16: Hoare triple {1668#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1675#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 09:16:42,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {1675#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1679#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 09:16:42,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1610#false} is VALID [2022-04-28 09:16:42,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#false} assume !false; {1610#false} is VALID [2022-04-28 09:16:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 09:16:42,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:42,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#false} assume !false; {1610#false} is VALID [2022-04-28 09:16:42,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {1689#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1610#false} is VALID [2022-04-28 09:16:42,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1689#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:16:42,537 INFO L272 TraceCheckUtils]: 16: Hoare triple {1697#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1693#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:16:42,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {1697#(not (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {1697#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:42,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1697#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:42,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !(~y~0 % 4294967296 < 10); {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {1609#true} ~x~0 := 0;~y~0 := 0; {1704#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:42,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {1609#true} call #t~ret6 := main(); {1609#true} is VALID [2022-04-28 09:16:42,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1609#true} {1609#true} #47#return; {1609#true} is VALID [2022-04-28 09:16:42,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {1609#true} assume true; {1609#true} is VALID [2022-04-28 09:16:42,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {1609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1609#true} is VALID [2022-04-28 09:16:42,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {1609#true} call ULTIMATE.init(); {1609#true} is VALID [2022-04-28 09:16:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 09:16:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678056970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:42,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2022-04-28 09:16:42,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202055708] [2022-04-28 09:16:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202055708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:42,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:16:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717732502] [2022-04-28 09:16:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:16:42,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:42,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:42,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:16:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:16:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:16:42,562 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,791 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 09:16:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:16:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 09:16:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 09:16:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 09:16:42,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-28 09:16:42,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:42,815 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:16:42,815 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:16:42,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:16:42,816 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:42,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:16:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 09:16:42,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:42,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,825 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,825 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,826 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:16:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:16:42,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:42,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:42,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 09:16:42,826 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 09:16:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,827 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:16:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:16:42,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:42,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:42,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:42,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 09:16:42,828 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-04-28 09:16:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:42,828 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 09:16:42,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:42,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 09:16:42,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:16:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:16:42,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:42,844 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:42,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:43,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 329129626, now seen corresponding path program 13 times [2022-04-28 09:16:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:43,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332970539] [2022-04-28 09:16:43,065 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:43,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:43,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 329129626, now seen corresponding path program 14 times [2022-04-28 09:16:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785172718] [2022-04-28 09:16:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {1937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1924#true} is VALID [2022-04-28 09:16:43,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1924#true} {1924#true} #47#return; {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:43,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1924#true} #47#return; {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1924#true} call #t~ret6 := main(); {1924#true} is VALID [2022-04-28 09:16:43,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} ~x~0 := 0;~y~0 := 0; {1924#true} is VALID [2022-04-28 09:16:43,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {1924#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1929#(= main_~y~0 0)} is VALID [2022-04-28 09:16:43,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {1929#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:43,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:43,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:43,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {1932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 09:16:43,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 09:16:43,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {1934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 09:16:43,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {1935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1936#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 7))} is VALID [2022-04-28 09:16:43,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 7))} assume !(~y~0 % 4294967296 < 10); {1925#false} is VALID [2022-04-28 09:16:43,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1925#false} is VALID [2022-04-28 09:16:43,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#false} assume !(~x~0 % 4294967296 < 268435455); {1925#false} is VALID [2022-04-28 09:16:43,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {1925#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1925#false} is VALID [2022-04-28 09:16:43,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {1925#false} ~cond := #in~cond; {1925#false} is VALID [2022-04-28 09:16:43,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {1925#false} assume 0 == ~cond; {1925#false} is VALID [2022-04-28 09:16:43,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-28 09:16:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:43,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785172718] [2022-04-28 09:16:43,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785172718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049965963] [2022-04-28 09:16:43,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:43,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:43,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:43,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 09:16:43,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:43,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:43,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:43,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1924#true} is VALID [2022-04-28 09:16:43,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1924#true} is VALID [2022-04-28 09:16:43,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-28 09:16:43,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1924#true} #47#return; {1924#true} is VALID [2022-04-28 09:16:43,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {1924#true} call #t~ret6 := main(); {1924#true} is VALID [2022-04-28 09:16:43,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} ~x~0 := 0;~y~0 := 0; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {1956#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1960#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:43,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1960#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1964#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 09:16:43,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1964#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1956#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {1956#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {1956#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1956#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1956#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1956#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {1956#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {1956#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1989#(= main_~x~0 1)} is VALID [2022-04-28 09:16:43,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {1989#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {1925#false} is VALID [2022-04-28 09:16:43,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {1925#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1925#false} is VALID [2022-04-28 09:16:43,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1925#false} ~cond := #in~cond; {1925#false} is VALID [2022-04-28 09:16:43,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1925#false} assume 0 == ~cond; {1925#false} is VALID [2022-04-28 09:16:43,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-28 09:16:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 09:16:43,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:43,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-28 09:16:43,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1925#false} assume 0 == ~cond; {1925#false} is VALID [2022-04-28 09:16:43,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1925#false} ~cond := #in~cond; {1925#false} is VALID [2022-04-28 09:16:43,505 INFO L272 TraceCheckUtils]: 17: Hoare triple {1925#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1925#false} is VALID [2022-04-28 09:16:43,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1925#false} is VALID [2022-04-28 09:16:43,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2017#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {2043#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {2047#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2043#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:43,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2047#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:43,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} ~x~0 := 0;~y~0 := 0; {2021#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:43,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {1924#true} call #t~ret6 := main(); {1924#true} is VALID [2022-04-28 09:16:43,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1924#true} #47#return; {1924#true} is VALID [2022-04-28 09:16:43,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-28 09:16:43,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1924#true} is VALID [2022-04-28 09:16:43,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1924#true} is VALID [2022-04-28 09:16:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 09:16:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049965963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:43,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:43,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2022-04-28 09:16:43,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:43,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332970539] [2022-04-28 09:16:43,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332970539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:43,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:43,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:16:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531060700] [2022-04-28 09:16:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 09:16:43,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:43,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:43,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:16:43,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:16:43,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:16:43,528 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:43,830 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 09:16:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:16:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 09:16:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 09:16:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 09:16:43,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-28 09:16:43,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:43,856 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:16:43,856 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:16:43,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:16:43,857 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:43,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:16:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 09:16:43,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:43,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,869 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,869 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:43,869 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 09:16:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 09:16:43,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:43,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:43,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 09:16:43,870 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 09:16:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:43,870 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 09:16:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 09:16:43,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:43,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:43,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:43,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 09:16:43,871 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-04-28 09:16:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:43,871 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 09:16:43,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:43,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 09:16:43,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 09:16:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 09:16:43,892 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:43,892 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:43,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:44,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:44,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 170316867, now seen corresponding path program 15 times [2022-04-28 09:16:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887040854] [2022-04-28 09:16:44,109 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:44,141 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:44,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 170316867, now seen corresponding path program 16 times [2022-04-28 09:16:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789535641] [2022-04-28 09:16:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:44,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {2270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 09:16:44,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 09:16:44,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2256#true} {2256#true} #47#return; {2256#true} is VALID [2022-04-28 09:16:44,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:44,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {2270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 09:16:44,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 09:16:44,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #47#return; {2256#true} is VALID [2022-04-28 09:16:44,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-28 09:16:44,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} ~x~0 := 0;~y~0 := 0; {2256#true} is VALID [2022-04-28 09:16:44,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {2256#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2261#(= main_~y~0 0)} is VALID [2022-04-28 09:16:44,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:44,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {2262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:44,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {2263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:44,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {2264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 09:16:44,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {2265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 09:16:44,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {2266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 09:16:44,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {2267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 09:16:44,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2269#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 8))} is VALID [2022-04-28 09:16:44,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {2269#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 8))} assume !(~y~0 % 4294967296 < 10); {2257#false} is VALID [2022-04-28 09:16:44,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {2257#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2257#false} is VALID [2022-04-28 09:16:44,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {2257#false} assume !(~x~0 % 4294967296 < 268435455); {2257#false} is VALID [2022-04-28 09:16:44,289 INFO L272 TraceCheckUtils]: 18: Hoare triple {2257#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2257#false} is VALID [2022-04-28 09:16:44,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {2257#false} ~cond := #in~cond; {2257#false} is VALID [2022-04-28 09:16:44,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {2257#false} assume 0 == ~cond; {2257#false} is VALID [2022-04-28 09:16:44,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-28 09:16:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789535641] [2022-04-28 09:16:44,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789535641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399780060] [2022-04-28 09:16:44,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:44,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:44,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 09:16:44,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:44,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:44,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:16:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:44,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:44,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-28 09:16:44,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 09:16:44,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 09:16:44,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #47#return; {2256#true} is VALID [2022-04-28 09:16:44,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-28 09:16:44,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} ~x~0 := 0;~y~0 := 0; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {2289#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {2289#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {2289#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {2289#(= main_~x~0 0)} is VALID [2022-04-28 09:16:44,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {2289#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2323#(= main_~x~0 1)} is VALID [2022-04-28 09:16:44,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {2323#(= main_~x~0 1)} is VALID [2022-04-28 09:16:44,423 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(= main_~x~0 1)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:44,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:44,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-28 09:16:44,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-28 09:16:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:16:44,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:44,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-28 09:16:44,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-28 09:16:44,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:44,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {2350#(<= 1 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:44,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {2350#(<= 1 (mod main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {2350#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:44,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2350#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:44,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(~y~0 % 4294967296 < 10); {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {2357#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} ~x~0 := 0;~y~0 := 0; {2357#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:44,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-28 09:16:44,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #47#return; {2256#true} is VALID [2022-04-28 09:16:44,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 09:16:44,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 09:16:44,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-28 09:16:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:16:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399780060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:44,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2022-04-28 09:16:44,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887040854] [2022-04-28 09:16:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887040854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:44,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:16:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317892310] [2022-04-28 09:16:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 09:16:44,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:44,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:44,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:16:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:44,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:16:44,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:16:44,563 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:44,865 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 09:16:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:16:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 09:16:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2022-04-28 09:16:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2022-04-28 09:16:44,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 35 transitions. [2022-04-28 09:16:44,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:44,902 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:16:44,902 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:16:44,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:16:44,903 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:44,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:16:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 09:16:44,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:44,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,918 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,919 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:44,919 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 09:16:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:16:44,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:44,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:44,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 09:16:44,921 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 09:16:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:44,922 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 09:16:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:16:44,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:44,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:44,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:44,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 09:16:44,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2022-04-28 09:16:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:44,923 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 09:16:44,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:44,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 09:16:44,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:16:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:16:44,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:44,945 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:44,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 09:16:45,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -457911366, now seen corresponding path program 17 times [2022-04-28 09:16:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:45,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273795578] [2022-04-28 09:16:45,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:45,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:45,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -457911366, now seen corresponding path program 18 times [2022-04-28 09:16:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486591897] [2022-04-28 09:16:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:45,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {2618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-28 09:16:45,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 09:16:45,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2603#true} {2603#true} #47#return; {2603#true} is VALID [2022-04-28 09:16:45,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:45,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-28 09:16:45,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 09:16:45,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #47#return; {2603#true} is VALID [2022-04-28 09:16:45,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret6 := main(); {2603#true} is VALID [2022-04-28 09:16:45,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~x~0 := 0;~y~0 := 0; {2603#true} is VALID [2022-04-28 09:16:45,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {2603#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2608#(= main_~y~0 0)} is VALID [2022-04-28 09:16:45,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2608#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 09:16:45,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 09:16:45,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 09:16:45,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 09:16:45,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 09:16:45,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {2613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 09:16:45,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 09:16:45,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 09:16:45,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 9))} is VALID [2022-04-28 09:16:45,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {2617#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 9))} assume !(~y~0 % 4294967296 < 10); {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} assume !(~x~0 % 4294967296 < 268435455); {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L272 TraceCheckUtils]: 19: Hoare triple {2604#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {2604#false} ~cond := #in~cond; {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {2604#false} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 09:16:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:45,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486591897] [2022-04-28 09:16:45,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486591897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:45,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994878745] [2022-04-28 09:16:45,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:45,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:45,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 09:16:45,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:16:45,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:45,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:16:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:45,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:45,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-28 09:16:45,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-28 09:16:45,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 09:16:45,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #47#return; {2603#true} is VALID [2022-04-28 09:16:45,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret6 := main(); {2603#true} is VALID [2022-04-28 09:16:45,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~x~0 := 0;~y~0 := 0; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {2637#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {2637#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {2637#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {2637#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2674#(= main_~x~0 1)} is VALID [2022-04-28 09:16:45,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {2674#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {2674#(= main_~x~0 1)} is VALID [2022-04-28 09:16:45,513 INFO L272 TraceCheckUtils]: 19: Hoare triple {2674#(= main_~x~0 1)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2681#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:45,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {2681#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2685#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:45,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {2685#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 09:16:45,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 09:16:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 09:16:45,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:45,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2022-04-28 09:16:45,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {2685#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2604#false} is VALID [2022-04-28 09:16:45,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {2681#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2685#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:45,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {2701#(<= 1 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2681#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:45,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {2701#(<= 1 (mod main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {2701#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:45,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2701#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-28 09:16:45,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(~y~0 % 4294967296 < 10); {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {2708#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} ~x~0 := 0;~y~0 := 0; {2708#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:16:45,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} call #t~ret6 := main(); {2603#true} is VALID [2022-04-28 09:16:45,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} #47#return; {2603#true} is VALID [2022-04-28 09:16:45,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} assume true; {2603#true} is VALID [2022-04-28 09:16:45,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2603#true} is VALID [2022-04-28 09:16:45,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2022-04-28 09:16:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 09:16:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994878745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:45,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:45,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2022-04-28 09:16:45,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273795578] [2022-04-28 09:16:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273795578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:45,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:45,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:16:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860249309] [2022-04-28 09:16:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:16:45,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:45,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:45,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:16:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:16:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:16:45,669 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:45,985 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 09:16:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:16:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:16:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2022-04-28 09:16:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2022-04-28 09:16:45,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 36 transitions. [2022-04-28 09:16:46,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:46,018 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:16:46,018 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 09:16:46,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:16:46,020 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:46,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 09:16:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 09:16:46,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:46,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,047 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,047 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:46,049 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 09:16:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 09:16:46,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:46,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:46,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 09:16:46,049 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 09:16:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:46,050 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 09:16:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 09:16:46,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:46,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:46,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:46,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 09:16:46,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2022-04-28 09:16:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:46,051 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 09:16:46,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 09:16:46,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 09:16:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:16:46,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:46,069 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:46,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:46,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:46,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1541849891, now seen corresponding path program 19 times [2022-04-28 09:16:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816456785] [2022-04-28 09:16:46,296 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:46,324 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:46,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1541849891, now seen corresponding path program 20 times [2022-04-28 09:16:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155322458] [2022-04-28 09:16:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:46,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:46,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {2974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2967#true} is VALID [2022-04-28 09:16:46,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {2967#true} assume true; {2967#true} is VALID [2022-04-28 09:16:46,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2967#true} {2967#true} #47#return; {2967#true} is VALID [2022-04-28 09:16:46,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:46,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {2974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2967#true} is VALID [2022-04-28 09:16:46,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {2967#true} assume true; {2967#true} is VALID [2022-04-28 09:16:46,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2967#true} {2967#true} #47#return; {2967#true} is VALID [2022-04-28 09:16:46,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2967#true} call #t~ret6 := main(); {2967#true} is VALID [2022-04-28 09:16:46,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2967#true} ~x~0 := 0;~y~0 := 0; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {2972#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {2972#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {2972#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2973#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:46,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {2973#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2968#false} is VALID [2022-04-28 09:16:46,379 INFO L272 TraceCheckUtils]: 20: Hoare triple {2968#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2968#false} is VALID [2022-04-28 09:16:46,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {2968#false} ~cond := #in~cond; {2968#false} is VALID [2022-04-28 09:16:46,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {2968#false} assume 0 == ~cond; {2968#false} is VALID [2022-04-28 09:16:46,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {2968#false} assume !false; {2968#false} is VALID [2022-04-28 09:16:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 09:16:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155322458] [2022-04-28 09:16:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155322458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57442027] [2022-04-28 09:16:46,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:46,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 09:16:46,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:46,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:46,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:46,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:46,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2022-04-28 09:16:46,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {2967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2967#true} is VALID [2022-04-28 09:16:46,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {2967#true} assume true; {2967#true} is VALID [2022-04-28 09:16:46,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2967#true} {2967#true} #47#return; {2967#true} is VALID [2022-04-28 09:16:46,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {2967#true} call #t~ret6 := main(); {2967#true} is VALID [2022-04-28 09:16:46,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {2967#true} ~x~0 := 0;~y~0 := 0; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {2972#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2996#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:46,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {2996#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3000#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-28 09:16:46,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {3000#(and (= main_~x~0 0) (= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {2972#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {2972#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {2972#(= main_~x~0 0)} is VALID [2022-04-28 09:16:46,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {2972#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3034#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:16:46,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {3034#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {2968#false} is VALID [2022-04-28 09:16:46,522 INFO L272 TraceCheckUtils]: 20: Hoare triple {2968#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2968#false} is VALID [2022-04-28 09:16:46,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {2968#false} ~cond := #in~cond; {2968#false} is VALID [2022-04-28 09:16:46,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {2968#false} assume 0 == ~cond; {2968#false} is VALID [2022-04-28 09:16:46,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {2968#false} assume !false; {2968#false} is VALID [2022-04-28 09:16:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:16:46,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:46,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {2968#false} assume !false; {2968#false} is VALID [2022-04-28 09:16:46,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {2968#false} assume 0 == ~cond; {2968#false} is VALID [2022-04-28 09:16:46,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {2968#false} ~cond := #in~cond; {2968#false} is VALID [2022-04-28 09:16:46,648 INFO L272 TraceCheckUtils]: 20: Hoare triple {2968#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2968#false} is VALID [2022-04-28 09:16:46,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2968#false} is VALID [2022-04-28 09:16:46,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3062#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3097#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {3101#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3097#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:46,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3101#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 1) 4294967296) 268435455))} is VALID [2022-04-28 09:16:46,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {2967#true} ~x~0 := 0;~y~0 := 0; {3066#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:46,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {2967#true} call #t~ret6 := main(); {2967#true} is VALID [2022-04-28 09:16:46,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2967#true} {2967#true} #47#return; {2967#true} is VALID [2022-04-28 09:16:46,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {2967#true} assume true; {2967#true} is VALID [2022-04-28 09:16:46,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {2967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2967#true} is VALID [2022-04-28 09:16:46,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2022-04-28 09:16:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:16:46,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57442027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:46,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:46,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-04-28 09:16:46,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:46,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816456785] [2022-04-28 09:16:46,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816456785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:46,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:46,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:16:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905069509] [2022-04-28 09:16:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:46,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 09:16:46,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:46,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:46,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:16:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:16:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:16:46,704 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:46,833 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-28 09:16:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:16:46,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 09:16:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:16:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:16:46,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 09:16:46,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:46,862 INFO L225 Difference]: With dead ends: 55 [2022-04-28 09:16:46,862 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 09:16:46,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:16:46,863 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:46,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 20 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 09:16:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-28 09:16:46,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:46,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,922 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,922 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:46,923 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-04-28 09:16:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-28 09:16:46,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:46,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:46,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 09:16:46,924 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 09:16:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:46,925 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-04-28 09:16:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-28 09:16:46,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:46,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:46,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:46,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-28 09:16:46,926 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2022-04-28 09:16:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:46,926 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-28 09:16:46,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:46,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-28 09:16:46,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 09:16:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:16:46,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:46,962 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:46,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:47,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 09:16:47,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1949118775, now seen corresponding path program 21 times [2022-04-28 09:16:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:47,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [796928655] [2022-04-28 09:16:47,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:47,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:47,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1949118775, now seen corresponding path program 22 times [2022-04-28 09:16:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:47,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793575860] [2022-04-28 09:16:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:47,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {3423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3415#true} is VALID [2022-04-28 09:16:47,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3415#true} assume true; {3415#true} is VALID [2022-04-28 09:16:47,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3415#true} {3415#true} #47#return; {3415#true} is VALID [2022-04-28 09:16:47,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {3415#true} call ULTIMATE.init(); {3423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:47,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3415#true} is VALID [2022-04-28 09:16:47,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3415#true} assume true; {3415#true} is VALID [2022-04-28 09:16:47,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3415#true} {3415#true} #47#return; {3415#true} is VALID [2022-04-28 09:16:47,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {3415#true} call #t~ret6 := main(); {3415#true} is VALID [2022-04-28 09:16:47,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {3415#true} ~x~0 := 0;~y~0 := 0; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {3420#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {3420#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {3420#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3422#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:47,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {3422#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {3416#false} is VALID [2022-04-28 09:16:47,333 INFO L272 TraceCheckUtils]: 33: Hoare triple {3416#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3416#false} is VALID [2022-04-28 09:16:47,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {3416#false} ~cond := #in~cond; {3416#false} is VALID [2022-04-28 09:16:47,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {3416#false} assume 0 == ~cond; {3416#false} is VALID [2022-04-28 09:16:47,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {3416#false} assume !false; {3416#false} is VALID [2022-04-28 09:16:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 09:16:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793575860] [2022-04-28 09:16:47,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793575860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491518573] [2022-04-28 09:16:47,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:47,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:47,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 09:16:47,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:47,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:47,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:16:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:47,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:47,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {3415#true} call ULTIMATE.init(); {3415#true} is VALID [2022-04-28 09:16:47,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {3415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3415#true} is VALID [2022-04-28 09:16:47,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {3415#true} assume true; {3415#true} is VALID [2022-04-28 09:16:47,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3415#true} {3415#true} #47#return; {3415#true} is VALID [2022-04-28 09:16:47,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {3415#true} call #t~ret6 := main(); {3415#true} is VALID [2022-04-28 09:16:47,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {3415#true} ~x~0 := 0;~y~0 := 0; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {3420#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3445#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:47,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {3445#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3449#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-28 09:16:47,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {3449#(and (= main_~x~0 0) (= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3453#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 09:16:47,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3453#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3420#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {3420#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {3420#(= main_~x~0 0)} is VALID [2022-04-28 09:16:47,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {3420#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:47,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {3421#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3523#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:47,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {3523#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {3416#false} is VALID [2022-04-28 09:16:47,671 INFO L272 TraceCheckUtils]: 33: Hoare triple {3416#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3416#false} is VALID [2022-04-28 09:16:47,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {3416#false} ~cond := #in~cond; {3416#false} is VALID [2022-04-28 09:16:47,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {3416#false} assume 0 == ~cond; {3416#false} is VALID [2022-04-28 09:16:47,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {3416#false} assume !false; {3416#false} is VALID [2022-04-28 09:16:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-04-28 09:16:47,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:47,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {3416#false} assume !false; {3416#false} is VALID [2022-04-28 09:16:47,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {3416#false} assume 0 == ~cond; {3416#false} is VALID [2022-04-28 09:16:47,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {3416#false} ~cond := #in~cond; {3416#false} is VALID [2022-04-28 09:16:47,868 INFO L272 TraceCheckUtils]: 33: Hoare triple {3416#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3416#false} is VALID [2022-04-28 09:16:47,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {3551#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3416#false} is VALID [2022-04-28 09:16:47,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {3623#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (< (mod (+ main_~y~0 1) 4294967296) 10)))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3623#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 09:16:47,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3631#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (< (mod (+ main_~y~0 2) 4294967296) 10)))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3627#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (< (mod (+ main_~y~0 1) 4294967296) 10)))} is VALID [2022-04-28 09:16:47,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3631#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (< (mod (+ main_~y~0 2) 4294967296) 10)))} is VALID [2022-04-28 09:16:47,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3415#true} ~x~0 := 0;~y~0 := 0; {3595#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:47,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {3415#true} call #t~ret6 := main(); {3415#true} is VALID [2022-04-28 09:16:47,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3415#true} {3415#true} #47#return; {3415#true} is VALID [2022-04-28 09:16:47,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {3415#true} assume true; {3415#true} is VALID [2022-04-28 09:16:47,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3415#true} is VALID [2022-04-28 09:16:47,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {3415#true} call ULTIMATE.init(); {3415#true} is VALID [2022-04-28 09:16:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 128 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-04-28 09:16:47,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491518573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:47,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:47,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2022-04-28 09:16:47,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [796928655] [2022-04-28 09:16:47,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [796928655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:47,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:47,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:16:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248847730] [2022-04-28 09:16:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:47,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 09:16:47,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:47,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:47,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:16:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:16:47,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:16:47,896 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:48,080 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 09:16:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:16:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 09:16:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 09:16:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 09:16:48,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 09:16:48,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:48,108 INFO L225 Difference]: With dead ends: 68 [2022-04-28 09:16:48,108 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:16:48,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:16:48,109 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:48,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:16:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2022-04-28 09:16:48,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:48,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,185 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,186 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:48,187 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 09:16:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 09:16:48,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:48,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:48,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 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 63 states. [2022-04-28 09:16:48,188 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 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 63 states. [2022-04-28 09:16:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:48,189 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 09:16:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 09:16:48,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:48,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:48,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:48,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-28 09:16:48,190 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 37 [2022-04-28 09:16:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:48,190 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-28 09:16:48,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:48,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-28 09:16:48,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 09:16:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 09:16:48,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:48,242 INFO L195 NwaCegarLoop]: trace histogram [30, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:48,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:48,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:16:48,455 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1730060061, now seen corresponding path program 23 times [2022-04-28 09:16:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:48,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399170002] [2022-04-28 09:16:48,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:48,521 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:48,521 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1730060061, now seen corresponding path program 24 times [2022-04-28 09:16:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:48,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296618852] [2022-04-28 09:16:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:48,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {4034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4025#true} is VALID [2022-04-28 09:16:48,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {4025#true} assume true; {4025#true} is VALID [2022-04-28 09:16:48,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4025#true} {4025#true} #47#return; {4025#true} is VALID [2022-04-28 09:16:48,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {4025#true} call ULTIMATE.init(); {4034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:48,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {4034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4025#true} is VALID [2022-04-28 09:16:48,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {4025#true} assume true; {4025#true} is VALID [2022-04-28 09:16:48,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4025#true} {4025#true} #47#return; {4025#true} is VALID [2022-04-28 09:16:48,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {4025#true} call #t~ret6 := main(); {4025#true} is VALID [2022-04-28 09:16:48,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {4025#true} ~x~0 := 0;~y~0 := 0; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {4030#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {4030#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:48,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {4030#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:48,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:48,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4033#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:16:48,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {4033#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 268435455); {4026#false} is VALID [2022-04-28 09:16:48,648 INFO L272 TraceCheckUtils]: 46: Hoare triple {4026#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4026#false} is VALID [2022-04-28 09:16:48,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {4026#false} ~cond := #in~cond; {4026#false} is VALID [2022-04-28 09:16:48,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {4026#false} assume 0 == ~cond; {4026#false} is VALID [2022-04-28 09:16:48,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {4026#false} assume !false; {4026#false} is VALID [2022-04-28 09:16:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 372 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-28 09:16:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296618852] [2022-04-28 09:16:48,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296618852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:48,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926766438] [2022-04-28 09:16:48,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:48,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:48,650 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:48,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 09:16:48,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 09:16:48,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:48,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:16:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:48,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:49,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {4025#true} call ULTIMATE.init(); {4025#true} is VALID [2022-04-28 09:16:49,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4025#true} is VALID [2022-04-28 09:16:49,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {4025#true} assume true; {4025#true} is VALID [2022-04-28 09:16:49,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4025#true} {4025#true} #47#return; {4025#true} is VALID [2022-04-28 09:16:49,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {4025#true} call #t~ret6 := main(); {4025#true} is VALID [2022-04-28 09:16:49,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {4025#true} ~x~0 := 0;~y~0 := 0; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {4030#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4056#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:16:49,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {4056#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4060#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 09:16:49,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {4060#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4064#(and (= main_~y~0 2) (= main_~x~0 0))} is VALID [2022-04-28 09:16:49,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(and (= main_~y~0 2) (= main_~x~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4068#(and (= main_~x~0 0) (= 2 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 09:16:49,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {4068#(and (= main_~x~0 0) (= 2 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {4030#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {4030#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {4030#(= main_~x~0 0)} is VALID [2022-04-28 09:16:49,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {4030#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:49,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {4031#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:49,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4174#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:49,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {4174#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4026#false} is VALID [2022-04-28 09:16:49,285 INFO L272 TraceCheckUtils]: 46: Hoare triple {4026#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4026#false} is VALID [2022-04-28 09:16:49,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {4026#false} ~cond := #in~cond; {4026#false} is VALID [2022-04-28 09:16:49,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {4026#false} assume 0 == ~cond; {4026#false} is VALID [2022-04-28 09:16:49,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {4026#false} assume !false; {4026#false} is VALID [2022-04-28 09:16:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-04-28 09:16:49,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:49,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {4026#false} assume !false; {4026#false} is VALID [2022-04-28 09:16:49,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {4026#false} assume 0 == ~cond; {4026#false} is VALID [2022-04-28 09:16:49,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {4026#false} ~cond := #in~cond; {4026#false} is VALID [2022-04-28 09:16:49,567 INFO L272 TraceCheckUtils]: 46: Hoare triple {4026#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4026#false} is VALID [2022-04-28 09:16:49,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {4202#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4026#false} is VALID [2022-04-28 09:16:49,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4202#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4206#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4246#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {4311#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {4315#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4311#(or (not (< (mod main_~y~0 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} is VALID [2022-04-28 09:16:49,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {4319#(or (< (mod (+ main_~x~0 3) 4294967296) 268435455) (not (< (mod (+ main_~y~0 2) 4294967296) 10)))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4315#(or (not (< (mod (+ main_~y~0 1) 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} is VALID [2022-04-28 09:16:49,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {4323#(or (not (< (mod (+ main_~y~0 3) 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4319#(or (< (mod (+ main_~x~0 3) 4294967296) 268435455) (not (< (mod (+ main_~y~0 2) 4294967296) 10)))} is VALID [2022-04-28 09:16:49,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4323#(or (not (< (mod (+ main_~y~0 3) 4294967296) 10)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} is VALID [2022-04-28 09:16:49,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {4025#true} ~x~0 := 0;~y~0 := 0; {4286#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:49,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {4025#true} call #t~ret6 := main(); {4025#true} is VALID [2022-04-28 09:16:49,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4025#true} {4025#true} #47#return; {4025#true} is VALID [2022-04-28 09:16:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {4025#true} assume true; {4025#true} is VALID [2022-04-28 09:16:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {4025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4025#true} is VALID [2022-04-28 09:16:49,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {4025#true} call ULTIMATE.init(); {4025#true} is VALID [2022-04-28 09:16:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 28 proven. 378 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-04-28 09:16:49,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926766438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:49,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:49,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2022-04-28 09:16:49,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:49,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399170002] [2022-04-28 09:16:49,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399170002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:49,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:49,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:16:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416959603] [2022-04-28 09:16:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:49,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 50 [2022-04-28 09:16:49,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:49,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:49,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:49,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:16:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:16:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:16:49,614 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:49,882 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-04-28 09:16:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:16:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 50 [2022-04-28 09:16:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 09:16:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 09:16:49,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 09:16:49,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:49,910 INFO L225 Difference]: With dead ends: 81 [2022-04-28 09:16:49,910 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 09:16:49,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:16:49,911 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:49,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 09:16:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-28 09:16:50,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:50,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:50,023 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:50,023 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:50,026 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-28 09:16:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-28 09:16:50,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:50,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:50,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 09:16:50,027 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 09:16:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:50,028 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-28 09:16:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-28 09:16:50,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:50,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:50,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:50,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-04-28 09:16:50,030 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 50 [2022-04-28 09:16:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:50,030 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-04-28 09:16:50,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:50,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2022-04-28 09:16:50,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-04-28 09:16:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 09:16:50,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:50,099 INFO L195 NwaCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:50,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:50,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 09:16:50,304 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 538347785, now seen corresponding path program 25 times [2022-04-28 09:16:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214674354] [2022-04-28 09:16:50,330 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:50,380 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:50,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 538347785, now seen corresponding path program 26 times [2022-04-28 09:16:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:50,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583632671] [2022-04-28 09:16:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {4807#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4797#true} is VALID [2022-04-28 09:16:50,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {4797#true} assume true; {4797#true} is VALID [2022-04-28 09:16:50,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4797#true} {4797#true} #47#return; {4797#true} is VALID [2022-04-28 09:16:50,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {4797#true} call ULTIMATE.init(); {4807#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:50,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {4807#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4797#true} is VALID [2022-04-28 09:16:50,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#true} assume true; {4797#true} is VALID [2022-04-28 09:16:50,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#true} {4797#true} #47#return; {4797#true} is VALID [2022-04-28 09:16:50,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#true} call #t~ret6 := main(); {4797#true} is VALID [2022-04-28 09:16:50,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#true} ~x~0 := 0;~y~0 := 0; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {4802#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {4802#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {4802#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:50,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:50,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4806#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:50,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {4806#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4798#false} is VALID [2022-04-28 09:16:50,522 INFO L272 TraceCheckUtils]: 59: Hoare triple {4798#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4798#false} is VALID [2022-04-28 09:16:50,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {4798#false} ~cond := #in~cond; {4798#false} is VALID [2022-04-28 09:16:50,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {4798#false} assume 0 == ~cond; {4798#false} is VALID [2022-04-28 09:16:50,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {4798#false} assume !false; {4798#false} is VALID [2022-04-28 09:16:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 09:16:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583632671] [2022-04-28 09:16:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583632671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460557882] [2022-04-28 09:16:50,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:50,524 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:50,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 09:16:50,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:50,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:50,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:16:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:51,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {4797#true} call ULTIMATE.init(); {4797#true} is VALID [2022-04-28 09:16:51,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4797#true} is VALID [2022-04-28 09:16:51,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#true} assume true; {4797#true} is VALID [2022-04-28 09:16:51,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#true} {4797#true} #47#return; {4797#true} is VALID [2022-04-28 09:16:51,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#true} call #t~ret6 := main(); {4797#true} is VALID [2022-04-28 09:16:51,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#true} ~x~0 := 0;~y~0 := 0; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {4802#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {4802#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {4802#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {4802#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {4802#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:51,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {4803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {4804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:51,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {4805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:51,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {4982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4798#false} is VALID [2022-04-28 09:16:51,067 INFO L272 TraceCheckUtils]: 59: Hoare triple {4798#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4798#false} is VALID [2022-04-28 09:16:51,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {4798#false} ~cond := #in~cond; {4798#false} is VALID [2022-04-28 09:16:51,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {4798#false} assume 0 == ~cond; {4798#false} is VALID [2022-04-28 09:16:51,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {4798#false} assume !false; {4798#false} is VALID [2022-04-28 09:16:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 09:16:51,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:51,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {4798#false} assume !false; {4798#false} is VALID [2022-04-28 09:16:51,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {4798#false} assume 0 == ~cond; {4798#false} is VALID [2022-04-28 09:16:51,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {4798#false} ~cond := #in~cond; {4798#false} is VALID [2022-04-28 09:16:51,318 INFO L272 TraceCheckUtils]: 59: Hoare triple {4798#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4798#false} is VALID [2022-04-28 09:16:51,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {5010#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4798#false} is VALID [2022-04-28 09:16:51,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5010#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5014#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5054#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5094#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#true} ~x~0 := 0;~y~0 := 0; {5134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:16:51,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#true} call #t~ret6 := main(); {4797#true} is VALID [2022-04-28 09:16:51,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#true} {4797#true} #47#return; {4797#true} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#true} assume true; {4797#true} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {4797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4797#true} is VALID [2022-04-28 09:16:51,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {4797#true} call ULTIMATE.init(); {4797#true} is VALID [2022-04-28 09:16:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 09:16:51,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460557882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:51,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:51,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:16:51,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:51,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214674354] [2022-04-28 09:16:51,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214674354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:51,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:51,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:16:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177220159] [2022-04-28 09:16:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 63 [2022-04-28 09:16:51,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:51,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:51,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:16:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:51,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:16:51,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:16:51,355 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:51,735 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-04-28 09:16:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:16:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 63 [2022-04-28 09:16:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 09:16:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 09:16:51,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 09:16:51,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:51,779 INFO L225 Difference]: With dead ends: 94 [2022-04-28 09:16:51,779 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 09:16:51,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:16:51,781 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:51,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 09:16:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-04-28 09:16:51,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:51,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,955 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,955 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:51,956 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-04-28 09:16:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-04-28 09:16:51,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:51,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:51,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 09:16:51,956 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 09:16:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:51,958 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-04-28 09:16:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-04-28 09:16:51,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:51,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:51,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:51,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-28 09:16:51,959 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 63 [2022-04-28 09:16:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:51,959 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-28 09:16:51,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:51,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2022-04-28 09:16:52,037 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-28 09:16:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-28 09:16:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 09:16:52,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:52,038 INFO L195 NwaCegarLoop]: trace histogram [50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:52,056 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-28 09:16:52,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 09:16:52,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -445755741, now seen corresponding path program 27 times [2022-04-28 09:16:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:52,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1547465226] [2022-04-28 09:16:52,269 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:52,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:52,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash -445755741, now seen corresponding path program 28 times [2022-04-28 09:16:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:52,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713009965] [2022-04-28 09:16:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:52,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {5732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5721#true} is VALID [2022-04-28 09:16:52,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-28 09:16:52,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5721#true} {5721#true} #47#return; {5721#true} is VALID [2022-04-28 09:16:52,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:52,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {5732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5721#true} is VALID [2022-04-28 09:16:52,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-28 09:16:52,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #47#return; {5721#true} is VALID [2022-04-28 09:16:52,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret6 := main(); {5721#true} is VALID [2022-04-28 09:16:52,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5721#true} ~x~0 := 0;~y~0 := 0; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {5726#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {5726#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:52,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {5726#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:52,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:52,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:52,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:52,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5731#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:52,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {5731#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 268435455); {5722#false} is VALID [2022-04-28 09:16:52,451 INFO L272 TraceCheckUtils]: 72: Hoare triple {5722#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5722#false} is VALID [2022-04-28 09:16:52,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {5722#false} ~cond := #in~cond; {5722#false} is VALID [2022-04-28 09:16:52,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {5722#false} assume 0 == ~cond; {5722#false} is VALID [2022-04-28 09:16:52,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2022-04-28 09:16:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-04-28 09:16:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:52,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713009965] [2022-04-28 09:16:52,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713009965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:52,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271919333] [2022-04-28 09:16:52,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:52,453 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:52,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 09:16:52,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:52,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:52,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:16:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:52,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:53,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5721#true} is VALID [2022-04-28 09:16:53,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {5721#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5721#true} is VALID [2022-04-28 09:16:53,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-28 09:16:53,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #47#return; {5721#true} is VALID [2022-04-28 09:16:53,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret6 := main(); {5721#true} is VALID [2022-04-28 09:16:53,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {5721#true} ~x~0 := 0;~y~0 := 0; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {5726#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {5726#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {5726#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {5726#(= main_~x~0 0)} is VALID [2022-04-28 09:16:53,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {5726#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:53,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {5727#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:53,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {5728#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:53,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {5729#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,059 INFO L290 TraceCheckUtils]: 64: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,059 INFO L290 TraceCheckUtils]: 66: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:53,061 INFO L290 TraceCheckUtils]: 70: Hoare triple {5730#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5946#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:53,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {5946#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 268435455); {5946#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:53,062 INFO L272 TraceCheckUtils]: 72: Hoare triple {5946#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5953#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 2)) (div (+ 5 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2)) (< |__VERIFIER_assert_#in~cond| 2))} is VALID [2022-04-28 09:16:53,062 INFO L290 TraceCheckUtils]: 73: Hoare triple {5953#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= (div (+ |__VERIFIER_assert_#in~cond| (- 5)) (- 2)) (div (+ 5 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2)) (< |__VERIFIER_assert_#in~cond| 2))} ~cond := #in~cond; {5957#(and (<= 0 __VERIFIER_assert_~cond) (< __VERIFIER_assert_~cond 2) (<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 2)) (div (+ 5 (* (- 1) __VERIFIER_assert_~cond)) 2)))} is VALID [2022-04-28 09:16:53,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {5957#(and (<= 0 __VERIFIER_assert_~cond) (< __VERIFIER_assert_~cond 2) (<= (div (+ (- 5) __VERIFIER_assert_~cond) (- 2)) (div (+ 5 (* (- 1) __VERIFIER_assert_~cond)) 2)))} assume 0 == ~cond; {5722#false} is VALID [2022-04-28 09:16:53,063 INFO L290 TraceCheckUtils]: 75: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2022-04-28 09:16:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-04-28 09:16:53,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:53,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2022-04-28 09:16:53,282 INFO L290 TraceCheckUtils]: 74: Hoare triple {5967#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5722#false} is VALID [2022-04-28 09:16:53,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {5971#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5967#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:16:53,283 INFO L272 TraceCheckUtils]: 72: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:16:53,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,285 INFO L290 TraceCheckUtils]: 69: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !(~y~0 % 4294967296 < 10); {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !(~y~0 % 4294967296 < 10); {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !(~y~0 % 4294967296 < 10); {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !(~y~0 % 4294967296 < 10); {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {5975#(not (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5975#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:53,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !(~y~0 % 4294967296 < 10); {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {5721#true} ~x~0 := 0;~y~0 := 0; {5982#(not (= (mod (+ main_~x~0 1) 2) 0))} is VALID [2022-04-28 09:16:53,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret6 := main(); {5721#true} is VALID [2022-04-28 09:16:53,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #47#return; {5721#true} is VALID [2022-04-28 09:16:53,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2022-04-28 09:16:53,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {5721#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5721#true} is VALID [2022-04-28 09:16:53,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5721#true} is VALID [2022-04-28 09:16:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2022-04-28 09:16:53,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271919333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:53,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:53,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 16 [2022-04-28 09:16:53,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:53,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1547465226] [2022-04-28 09:16:53,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1547465226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:53,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:53,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:16:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866209490] [2022-04-28 09:16:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 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 76 [2022-04-28 09:16:53,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:53,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:53,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:53,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:16:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:16:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:16:53,343 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:53,887 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-04-28 09:16:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:16:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 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 76 [2022-04-28 09:16:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 09:16:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 09:16:53,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 09:16:53,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:53,927 INFO L225 Difference]: With dead ends: 107 [2022-04-28 09:16:53,927 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 09:16:53,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:16:53,928 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:53,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 43 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:16:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 09:16:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-04-28 09:16:54,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:54,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:54,149 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:54,149 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:54,151 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 09:16:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-28 09:16:54,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:54,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:54,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 09:16:54,151 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 09:16:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:54,152 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 09:16:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-28 09:16:54,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:54,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:54,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:54,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-04-28 09:16:54,154 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 76 [2022-04-28 09:16:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:54,154 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-04-28 09:16:54,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:54,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 96 transitions. [2022-04-28 09:16:54,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-04-28 09:16:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 09:16:54,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:54,260 INFO L195 NwaCegarLoop]: trace histogram [60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:54,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:54,473 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1359606601, now seen corresponding path program 29 times [2022-04-28 09:16:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020137287] [2022-04-28 09:16:54,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:54,552 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:54,552 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1359606601, now seen corresponding path program 30 times [2022-04-28 09:16:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:54,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031286348] [2022-04-28 09:16:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:54,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {6817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6805#true} is VALID [2022-04-28 09:16:54,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6805#true} assume true; {6805#true} is VALID [2022-04-28 09:16:54,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6805#true} {6805#true} #47#return; {6805#true} is VALID [2022-04-28 09:16:54,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {6805#true} call ULTIMATE.init(); {6817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:54,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6805#true} is VALID [2022-04-28 09:16:54,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6805#true} assume true; {6805#true} is VALID [2022-04-28 09:16:54,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6805#true} {6805#true} #47#return; {6805#true} is VALID [2022-04-28 09:16:54,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {6805#true} call #t~ret6 := main(); {6805#true} is VALID [2022-04-28 09:16:54,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {6805#true} ~x~0 := 0;~y~0 := 0; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {6810#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {6810#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {6810#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {6810#(= main_~x~0 0)} is VALID [2022-04-28 09:16:54,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {6810#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~y~0 % 4294967296 < 10); {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:16:54,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {6811#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~y~0 % 4294967296 < 10); {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:54,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {6812#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,715 INFO L290 TraceCheckUtils]: 55: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:16:54,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {6813#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,717 INFO L290 TraceCheckUtils]: 60: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~y~0 % 4294967296 < 10); {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:54,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {6814#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,725 INFO L290 TraceCheckUtils]: 81: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~y~0 % 4294967296 < 10); {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:16:54,726 INFO L290 TraceCheckUtils]: 83: Hoare triple {6815#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6816#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:54,727 INFO L290 TraceCheckUtils]: 84: Hoare triple {6816#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {6806#false} is VALID [2022-04-28 09:16:54,727 INFO L272 TraceCheckUtils]: 85: Hoare triple {6806#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6806#false} is VALID [2022-04-28 09:16:54,727 INFO L290 TraceCheckUtils]: 86: Hoare triple {6806#false} ~cond := #in~cond; {6806#false} is VALID [2022-04-28 09:16:54,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {6806#false} assume 0 == ~cond; {6806#false} is VALID [2022-04-28 09:16:54,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {6806#false} assume !false; {6806#false} is VALID [2022-04-28 09:16:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1851 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-28 09:16:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031286348] [2022-04-28 09:16:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031286348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652498283] [2022-04-28 09:16:54,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:54,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:54,732 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:16:54,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 09:16:55,685 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 09:16:55,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:55,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:16:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:55,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:56,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {6805#true} call ULTIMATE.init(); {6805#true} is VALID [2022-04-28 09:16:56,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {6805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6805#true} is VALID [2022-04-28 09:16:56,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {6805#true} assume true; {6805#true} is VALID [2022-04-28 09:16:56,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6805#true} {6805#true} #47#return; {6805#true} is VALID [2022-04-28 09:16:56,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {6805#true} call #t~ret6 := main(); {6805#true} is VALID [2022-04-28 09:16:56,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {6805#true} ~x~0 := 0;~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {6805#true} assume !(~y~0 % 4294967296 < 10); {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {6805#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {6805#true} assume !(~y~0 % 4294967296 < 10); {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {6805#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {6805#true} assume !(~y~0 % 4294967296 < 10); {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {6805#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {6805#true} assume !(~y~0 % 4294967296 < 10); {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {6805#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6805#true} is VALID [2022-04-28 09:16:56,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {6805#true} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {6805#true} assume !(~y~0 % 4294967296 < 10); {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {6805#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6805#true} is VALID [2022-04-28 09:16:56,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,218 INFO L290 TraceCheckUtils]: 74: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,219 INFO L290 TraceCheckUtils]: 76: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,219 INFO L290 TraceCheckUtils]: 77: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,219 INFO L290 TraceCheckUtils]: 78: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,219 INFO L290 TraceCheckUtils]: 79: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,220 INFO L290 TraceCheckUtils]: 80: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,220 INFO L290 TraceCheckUtils]: 81: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {7034#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,221 INFO L290 TraceCheckUtils]: 83: Hoare triple {7034#(< (mod main_~x~0 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7071#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} is VALID [2022-04-28 09:16:56,221 INFO L290 TraceCheckUtils]: 84: Hoare triple {7071#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7075#(and (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))} is VALID [2022-04-28 09:16:56,225 INFO L272 TraceCheckUtils]: 85: Hoare triple {7075#(and (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7079#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< |__VERIFIER_assert_#in~cond| 2) (< (div (+ (div (+ 4294967295 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2) (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2) (* (- 1) (div (+ (- 268435455) |__VERIFIER_assert_#in~cond|) (- 2)))) 2147483648) 1)))} is VALID [2022-04-28 09:16:56,225 INFO L290 TraceCheckUtils]: 86: Hoare triple {7079#(and (<= 0 |__VERIFIER_assert_#in~cond|) (< |__VERIFIER_assert_#in~cond| 2) (< (div (+ (div (+ 4294967295 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2) (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 (* (- 1) |__VERIFIER_assert_#in~cond|)) 2) (* (- 1) (div (+ (- 268435455) |__VERIFIER_assert_#in~cond|) (- 2)))) 2147483648) 1)))} ~cond := #in~cond; {7083#(and (<= 0 __VERIFIER_assert_~cond) (< __VERIFIER_assert_~cond 2) (< (div (+ (div (+ 4294967295 (* (- 1) __VERIFIER_assert_~cond)) 2) (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 (* (- 1) __VERIFIER_assert_~cond)) 2) (* (- 1) (div (+ (- 268435455) __VERIFIER_assert_~cond) (- 2)))) 2147483648) 1)))} is VALID [2022-04-28 09:16:56,226 INFO L290 TraceCheckUtils]: 87: Hoare triple {7083#(and (<= 0 __VERIFIER_assert_~cond) (< __VERIFIER_assert_~cond 2) (< (div (+ (div (+ 4294967295 (* (- 1) __VERIFIER_assert_~cond)) 2) (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 (* (- 1) __VERIFIER_assert_~cond)) 2) (* (- 1) (div (+ (- 268435455) __VERIFIER_assert_~cond) (- 2)))) 2147483648) 1)))} assume 0 == ~cond; {6806#false} is VALID [2022-04-28 09:16:56,226 INFO L290 TraceCheckUtils]: 88: Hoare triple {6806#false} assume !false; {6806#false} is VALID [2022-04-28 09:16:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2022-04-28 09:16:56,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:16:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652498283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:16:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-04-28 09:16:56,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020137287] [2022-04-28 09:16:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020137287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:16:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185194109] [2022-04-28 09:16:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 09:16:56,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:56,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:56,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:16:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:16:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:16:56,250 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:56,681 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-04-28 09:16:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:16:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 09:16:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-28 09:16:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-28 09:16:56,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2022-04-28 09:16:56,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:56,701 INFO L225 Difference]: With dead ends: 90 [2022-04-28 09:16:56,701 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:16:56,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:16:56,701 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:56,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:16:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:16:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:16:56,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:56,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:16:56,702 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:16:56,702 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:16:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:56,702 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:16:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:16:56,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:56,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:56,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:16:56,702 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:16:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:56,702 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:16:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:16:56,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:56,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:56,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:56,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:16:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:16:56,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2022-04-28 09:16:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:56,703 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:16:56,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:16:56,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:16:56,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:16:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:16:56,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:56,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:16:56,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:16:56,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:16:58,200 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:16:58,201 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:16:58,201 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod main_~x~0 4294967296) 268435455) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))) [2022-04-28 09:16:58,201 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod main_~x~0 4294967296) 268435455) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455))) [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-28 09:16:58,201 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 24) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) [2022-04-28 09:16:58,201 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 24) the Hoare annotation is: (and (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) [2022-04-28 09:16:58,202 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:16:58,202 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 09:16:58,202 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (not (< |__VERIFIER_assert_#in~cond| 2)) (not (let ((.cse0 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (div (+ 4294967295 .cse0) 2) (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 .cse0) 2) (* (- 1) (div (+ (- 268435455) |__VERIFIER_assert_#in~cond|) (- 2)))) 2147483648) 1))))) [2022-04-28 09:16:58,202 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (not (< |__VERIFIER_assert_#in~cond| 2)) (and (<= 0 __VERIFIER_assert_~cond) (< __VERIFIER_assert_~cond 2) (let ((.cse0 (* (- 1) __VERIFIER_assert_~cond))) (< (div (+ (div (+ 4294967295 .cse0) 2) (* (- 1) (div (+ (- 1) __VERIFIER_assert_~cond) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 .cse0) 2) (* (- 1) (div (+ (- 268435455) __VERIFIER_assert_~cond) (- 2)))) 2147483648) 1)))) (not (let ((.cse1 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (div (+ 4294967295 .cse1) 2) (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 .cse1) 2) (* (- 1) (div (+ (- 268435455) |__VERIFIER_assert_#in~cond|) (- 2)))) 2147483648) 1))))) [2022-04-28 09:16:58,202 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 09:16:58,202 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (or (not (<= 0 |__VERIFIER_assert_#in~cond|)) (not (< |__VERIFIER_assert_#in~cond| 2)) (not (let ((.cse0 (* (- 1) |__VERIFIER_assert_#in~cond|))) (< (div (+ (div (+ 4294967295 .cse0) 2) (* (- 1) (div (+ (- 1) |__VERIFIER_assert_#in~cond|) (- 2)))) (- 2147483648)) (+ (div (+ (div (+ 268435455 .cse0) 2) (* (- 1) (div (+ (- 268435455) |__VERIFIER_assert_#in~cond|) (- 2)))) 2147483648) 1))))) [2022-04-28 09:16:58,204 INFO L356 BasicCegarLoop]: Path program histogram: [30, 2, 2] [2022-04-28 09:16:58,206 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:16:58,208 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:16:58,210 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:16:58,218 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:16:58,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:16:58 BoogieIcfgContainer [2022-04-28 09:16:58,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:16:58,236 INFO L158 Benchmark]: Toolchain (without parser) took 21573.80ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 124.3MB in the beginning and 257.9MB in the end (delta: -133.7MB). Peak memory consumption was 164.0MB. Max. memory is 8.0GB. [2022-04-28 09:16:58,236 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:16:58,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 174.1MB. Free memory was 124.0MB in the beginning and 149.1MB in the end (delta: -25.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-28 09:16:58,236 INFO L158 Benchmark]: Boogie Preprocessor took 34.61ms. Allocated memory is still 174.1MB. Free memory was 149.1MB in the beginning and 147.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:16:58,236 INFO L158 Benchmark]: RCFGBuilder took 234.75ms. Allocated memory is still 174.1MB. Free memory was 147.5MB in the beginning and 136.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:16:58,237 INFO L158 Benchmark]: TraceAbstraction took 21130.82ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 136.0MB in the beginning and 257.9MB in the end (delta: -121.9MB). Peak memory consumption was 175.9MB. Max. memory is 8.0GB. [2022-04-28 09:16:58,237 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 174.1MB. Free memory was 124.0MB in the beginning and 149.1MB in the end (delta: -25.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.61ms. Allocated memory is still 174.1MB. Free memory was 149.1MB in the beginning and 147.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 234.75ms. Allocated memory is still 174.1MB. Free memory was 147.5MB in the beginning and 136.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21130.82ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 136.0MB in the beginning and 257.9MB in the end (delta: -121.9MB). Peak memory consumption was 175.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 17, TraceHistogramMax: 60, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 537 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 254 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 867 SyntacticMatches, 8 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=16, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 62 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 116 PreInvPairs, 232 NumberOfFragments, 267 HoareAnnotationTreeSize, 116 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 20 FomulaSimplificationsInter, 16756 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (x == 0 && y == 0) || (x + 4294967295) % 4294967296 < 268435455 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: x == 0 || (x % 4294967296 < 268435455 && (x + 4294967295) % 4294967296 < 268435455) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:16:58,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...