/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:01:53,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:01:53,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:01:53,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:01:53,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:01:53,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:01:53,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:01:53,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:01:53,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:01:53,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:01:53,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:01:53,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:01:53,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:01:53,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:01:53,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:01:53,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:01:53,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:01:53,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:01:53,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:01:53,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:01:53,468 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:01:53,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:01:53,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:01:53,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:01:53,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:01:53,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:01:53,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:01:53,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:01:53,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:01:53,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:01:53,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:01:53,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:01:53,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:01:53,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:01:53,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:01:53,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:01:53,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:01:53,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:01:53,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:01:53,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:01:53,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:01:53,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:01:53,483 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:01:53,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:01:53,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:01:53,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:01:53,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:01:53,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:01:53,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:01:53,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:01:53,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:01:53,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:01:53,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:01:53,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:53,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:01:53,494 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:01:53,495 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:01:53,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:01:53,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:01:53,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:01:53,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:01:53,733 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:01:53,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-28 09:01:53,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0698a793/9f5a320dadc048aa8d15e5654832128d/FLAGffe83c55a [2022-04-28 09:01:54,157 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:01:54,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-28 09:01:54,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0698a793/9f5a320dadc048aa8d15e5654832128d/FLAGffe83c55a [2022-04-28 09:01:54,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0698a793/9f5a320dadc048aa8d15e5654832128d [2022-04-28 09:01:54,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:01:54,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:01:54,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:54,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:01:54,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:01:54,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3afc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54, skipping insertion in model container [2022-04-28 09:01:54,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:01:54,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:01:54,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-28 09:01:54,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:54,368 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:01:54,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-28 09:01:54,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:54,394 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:01:54,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54 WrapperNode [2022-04-28 09:01:54,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:54,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:01:54,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:01:54,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:01:54,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:01:54,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:01:54,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:01:54,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:01:54,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (1/1) ... [2022-04-28 09:01:54,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:54,460 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:01:54,477 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:01:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:01:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:01:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:01:54,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:01:54,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:01:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:01:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:01:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:01:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:01:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:01:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:01:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:01:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:01:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:01:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:01:54,542 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:01:54,543 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:01:54,625 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:01:54,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:01:54,629 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:01:54,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:54 BoogieIcfgContainer [2022-04-28 09:01:54,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:01:54,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:01:54,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:01:54,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:01:54,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:01:54" (1/3) ... [2022-04-28 09:01:54,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c58691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:54, skipping insertion in model container [2022-04-28 09:01:54,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:54" (2/3) ... [2022-04-28 09:01:54,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c58691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:54, skipping insertion in model container [2022-04-28 09:01:54,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:54" (3/3) ... [2022-04-28 09:01:54,635 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2022-04-28 09:01:54,644 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:01:54,644 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:01:54,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:01:54,684 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@76cc89a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b1d3a23 [2022-04-28 09:01:54,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:01:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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:01:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:01:54,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:54,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:54,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2022-04-28 09:01:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:54,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860048783] [2022-04-28 09:01:54,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:01:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 2 times [2022-04-28 09:01:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:54,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60488351] [2022-04-28 09:01:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:55,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-28 09:01:55,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:01:55,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-28 09:01:55,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:55,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-28 09:01:55,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:01:55,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-28 09:01:55,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-28 09:01:55,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:55,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:55,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:55,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:55,136 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:55,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:55,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 09:01:55,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 09:01:55,138 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:01:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:55,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60488351] [2022-04-28 09:01:55,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60488351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:55,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:55,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:01:55,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:55,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860048783] [2022-04-28 09:01:55,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860048783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:55,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:01:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754194616] [2022-04-28 09:01:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:01:55,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:55,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:01:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:01:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:01:55,195 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,582 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-28 09:01:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:01:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:01:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 09:01:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 09:01:55,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 09:01:55,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:55,715 INFO L225 Difference]: With dead ends: 41 [2022-04-28 09:01:55,715 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:01:55,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:01:55,719 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:55,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:01:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-28 09:01:55,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:55,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:55,748 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:55,749 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,751 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 09:01:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:01:55,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 09:01:55,752 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 09:01:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,754 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 09:01:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:01:55,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:55,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 09:01:55,757 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-28 09:01:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:55,757 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 09:01:55,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 09:01:55,781 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:01:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:01:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:01:55,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:55,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:01:55,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2022-04-28 09:01:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822266903] [2022-04-28 09:01:56,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:56,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 2 times [2022-04-28 09:01:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:56,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117885166] [2022-04-28 09:01:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 09:01:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:01:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 09:01:56,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 09:01:56,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:56,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:56,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-28 09:01:56,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 09:01:56,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-28 09:01:56,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:56,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:56,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:56,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:56,352 INFO L272 TraceCheckUtils]: 9: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-28 09:01:56,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 09:01:56,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 09:01:56,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,353 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:56,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume !false; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:56,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {244#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-28 09:01:56,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {245#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:01:56,359 INFO L272 TraceCheckUtils]: 17: Hoare triple {245#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {246#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:56,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {246#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {247#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:56,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {247#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {233#false} is VALID [2022-04-28 09:01:56,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-28 09:01:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117885166] [2022-04-28 09:01:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117885166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124693372] [2022-04-28 09:01:56,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:56,372 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:01:56,374 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:01:56,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:56,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:56,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:01:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:56,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2022-04-28 09:01:56,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-28 09:01:56,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 09:01:56,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-28 09:01:56,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:56,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:56,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:56,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:56,762 INFO L272 TraceCheckUtils]: 9: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-28 09:01:56,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 09:01:56,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 09:01:56,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:56,763 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #46#return; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:56,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !false; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:56,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {298#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-28 09:01:56,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {298#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {302#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-28 09:01:56,766 INFO L272 TraceCheckUtils]: 17: Hoare triple {302#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:56,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:56,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-04-28 09:01:56,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-28 09:01:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:56,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:57,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-28 09:01:57,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-04-28 09:01:57,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:57,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:57,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {330#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {326#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-28 09:01:57,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {330#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-28 09:01:57,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume !false; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:57,349 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} #46#return; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:57,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:57,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 09:01:57,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 09:01:57,350 INFO L272 TraceCheckUtils]: 9: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-28 09:01:57,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:57,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {356#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:57,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume !false; {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:57,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:57,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-28 09:01:57,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-28 09:01:57,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 09:01:57,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-28 09:01:57,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2022-04-28 09:01:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:57,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124693372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:57,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:57,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-28 09:01:57,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:57,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822266903] [2022-04-28 09:01:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822266903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:57,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:57,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:01:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511358763] [2022-04-28 09:01:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:01:57,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:57,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:57,376 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:01:57,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:01:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:01:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:01:57,377 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:57,654 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 09:01:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:01:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:01:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 09:01:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 09:01:57,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-28 09:01:57,685 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:01:57,686 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:01:57,686 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 09:01:57,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:01:57,687 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:57,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 09:01:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-04-28 09:01:57,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:57,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:57,710 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:57,710 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:57,711 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 09:01:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 09:01:57,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:57,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-28 09:01:57,712 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-28 09:01:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:57,714 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 09:01:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 09:01:57,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:57,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:57,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:57,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 09:01:57,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2022-04-28 09:01:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 09:01:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:57,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 09:01:57,743 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:01:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 09:01:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:01:57,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:57,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:57,764 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:01:57,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:57,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1109836175, now seen corresponding path program 1 times [2022-04-28 09:01:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:57,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774498097] [2022-04-28 09:01:58,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:58,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1109836175, now seen corresponding path program 2 times [2022-04-28 09:01:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:58,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587846867] [2022-04-28 09:01:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-28 09:01:58,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-28 09:01:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:01:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-28 09:01:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-28 09:01:58,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:01:58,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:58,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-28 09:01:58,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-28 09:01:58,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-28 09:01:58,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(= main_~x~0 0)} assume !false; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:01:58,386 INFO L272 TraceCheckUtils]: 9: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-28 09:01:58,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-28 09:01:58,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-28 09:01:58,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,388 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:01:58,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:01:58,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-28 09:01:58,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-28 09:01:58,399 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-28 09:01:58,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-28 09:01:58,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-28 09:01:58,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-28 09:01:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:58,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587846867] [2022-04-28 09:01:58,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587846867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:58,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803493394] [2022-04-28 09:01:58,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:58,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:58,401 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:01:58,432 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:01:58,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:58,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:58,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:01:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:58,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-28 09:01:58,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-28 09:01:58,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(= main_~x~0 0)} assume !false; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {591#(= main_~x~0 0)} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:01:58,491 INFO L272 TraceCheckUtils]: 9: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-28 09:01:58,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,492 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {625#(= (+ (- 1) main_~x~0) 0)} #46#return; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:01:58,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} assume !false; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-28 09:01:58,493 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-28 09:01:58,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-28 09:01:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:58,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:58,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-28 09:01:58,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-28 09:01:58,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-28 09:01:58,561 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-28 09:01:58,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-28 09:01:58,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-28 09:01:58,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} assume !false; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:58,562 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {677#(< (mod main_~x~0 4294967296) 10)} #46#return; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:58,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-28 09:01:58,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-28 09:01:58,563 INFO L272 TraceCheckUtils]: 9: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-28 09:01:58,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:58,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:58,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:58,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:58,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-28 09:01:58,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-28 09:01:58,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-28 09:01:58,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-28 09:01:58,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2022-04-28 09:01:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:58,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803493394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:58,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:58,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 09:01:58,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:58,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774498097] [2022-04-28 09:01:58,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774498097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:58,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:58,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106639770] [2022-04-28 09:01:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:58,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:01:58,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:58,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:58,580 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:01:58,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:58,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:01:58,581 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:58,693 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-28 09:01:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:01:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 09:01:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 09:01:58,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-28 09:01:58,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:58,733 INFO L225 Difference]: With dead ends: 41 [2022-04-28 09:01:58,734 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:01:58,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:01:58,742 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:58,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:01:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-28 09:01:58,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:58,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:01:58,779 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:01:58,779 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:01:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:58,785 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 09:01:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 09:01:58,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:58,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:58,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 09:01:58,787 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 09:01:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:58,793 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 09:01:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 09:01:58,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:58,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:58,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:58,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:01:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-28 09:01:58,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-28 09:01:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:58,797 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-28 09:01:58,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:01:58,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-28 09:01:58,830 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:01:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 09:01:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:01:58,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:58,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:58,855 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:01:59,047 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,SelfDestructingSolverStorable2 [2022-04-28 09:01:59,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash 723660460, now seen corresponding path program 3 times [2022-04-28 09:01:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965034628] [2022-04-28 09:01:59,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:59,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 723660460, now seen corresponding path program 4 times [2022-04-28 09:01:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164913297] [2022-04-28 09:01:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:59,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-28 09:01:59,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-28 09:01:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:01:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:59,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:01:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:59,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} #46#return; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:59,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-28 09:01:59,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-28 09:01:59,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-28 09:01:59,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {939#(= main_~x~0 0)} is VALID [2022-04-28 09:01:59,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(= main_~x~0 0)} assume !false; {939#(= main_~x~0 0)} is VALID [2022-04-28 09:01:59,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {939#(= main_~x~0 0)} is VALID [2022-04-28 09:01:59,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,409 INFO L272 TraceCheckUtils]: 9: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,411 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,413 INFO L272 TraceCheckUtils]: 17: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,414 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} #46#return; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !false; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-28 09:01:59,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-28 09:01:59,416 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-28 09:01:59,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-28 09:01:59,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-28 09:01:59,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-28 09:01:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:01:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164913297] [2022-04-28 09:01:59,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164913297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610458207] [2022-04-28 09:01:59,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:59,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:59,418 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:01:59,419 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:01:59,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:59,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:59,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:01:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:59,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:59,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-28 09:01:59,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-28 09:01:59,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {969#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:59,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {969#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {939#(= main_~x~0 0)} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,688 INFO L272 TraceCheckUtils]: 9: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,689 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,690 INFO L272 TraceCheckUtils]: 17: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,691 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-28 09:01:59,692 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-28 09:01:59,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-28 09:01:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:01:59,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:59,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-28 09:01:59,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-28 09:01:59,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-28 09:01:59,788 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-28 09:01:59,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-28 09:01:59,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-28 09:01:59,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} assume !false; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:59,789 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {1055#(< (mod main_~x~0 4294967296) 10)} #46#return; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:59,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,789 INFO L272 TraceCheckUtils]: 17: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:01:59,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:59,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:59,791 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:59,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-28 09:01:59,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-28 09:01:59,791 INFO L272 TraceCheckUtils]: 9: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-28 09:01:59,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:01:59,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:01:59,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:01:59,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:01:59,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-28 09:01:59,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-28 09:01:59,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-28 09:01:59,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-28 09:01:59,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2022-04-28 09:01:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:01:59,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610458207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:59,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:59,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 11 [2022-04-28 09:01:59,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:59,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965034628] [2022-04-28 09:01:59,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965034628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:59,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:59,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156563736] [2022-04-28 09:01:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 09:01:59,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:59,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:59,817 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:01:59,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:01:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:01:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:01:59,818 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:59,963 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 09:01:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:01:59,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 09:01:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 09:01:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 09:01:59,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 09:01:59,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:59,993 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:01:59,993 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 09:01:59,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:01:59,994 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:59,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 22 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 09:02:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 09:02:00,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:00,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:00,039 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:00,039 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:00,040 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 09:02:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 09:02:00,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:00,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:00,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 09:02:00,041 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 09:02:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:00,042 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 09:02:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 09:02:00,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:00,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:00,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:00,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 09:02:00,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-28 09:02:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:00,044 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 09:02:00,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:02:00,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 09:02:00,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 09:02:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:02:00,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:00,079 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:00,097 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:02:00,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:00,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:00,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:00,295 INFO L85 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 5 times [2022-04-28 09:02:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:00,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071445865] [2022-04-28 09:02:00,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:00,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 6 times [2022-04-28 09:02:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:00,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617065417] [2022-04-28 09:02:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1363#true} is VALID [2022-04-28 09:02:00,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-28 09:02:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:02:00,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:00,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1363#true} is VALID [2022-04-28 09:02:00,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-28 09:02:00,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret4 := main(); {1363#true} is VALID [2022-04-28 09:02:00,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:00,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#(= main_~x~0 0)} assume !false; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:00,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:00,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:00,631 INFO L272 TraceCheckUtils]: 9: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:00,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,632 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1363#true} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:00,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:00,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:00,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:00,633 INFO L272 TraceCheckUtils]: 17: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:00,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,634 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1363#true} {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:00,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:00,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:00,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:02:00,635 INFO L272 TraceCheckUtils]: 25: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:00,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:00,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:00,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:00,636 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1363#true} {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:02:00,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !false; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:02:00,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10); {1364#false} is VALID [2022-04-28 09:02:00,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {1364#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1364#false} is VALID [2022-04-28 09:02:00,637 INFO L272 TraceCheckUtils]: 33: Hoare triple {1364#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1364#false} is VALID [2022-04-28 09:02:00,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {1364#false} ~cond := #in~cond; {1364#false} is VALID [2022-04-28 09:02:00,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {1364#false} assume 0 == ~cond; {1364#false} is VALID [2022-04-28 09:02:00,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-04-28 09:02:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:02:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617065417] [2022-04-28 09:02:00,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617065417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100066027] [2022-04-28 09:02:00,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:02:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:00,656 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:02:00,657 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:02:00,808 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:02:00,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:00,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:02:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:00,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:02,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1363#true} is VALID [2022-04-28 09:02:02,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1363#true} is VALID [2022-04-28 09:02:02,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:02,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-28 09:02:02,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret4 := main(); {1363#true} is VALID [2022-04-28 09:02:02,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:02,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#(= main_~x~0 0)} assume !false; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:02,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1368#(= main_~x~0 0)} is VALID [2022-04-28 09:02:02,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:02,350 INFO L272 TraceCheckUtils]: 9: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:02,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {1363#true} ~cond := #in~cond; {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:02,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:02,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:02,352 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} is VALID [2022-04-28 09:02:02,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} assume !false; {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} is VALID [2022-04-28 09:02:02,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-28 09:02:02,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-28 09:02:02,355 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:02,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-28 09:02:02,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-28 09:02:02,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-28 09:02:02,356 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1363#true} {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} #46#return; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-28 09:02:02,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} assume !false; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-28 09:02:02,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1461#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-28 09:02:02,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-28 09:02:02,365 INFO L272 TraceCheckUtils]: 25: Hoare triple {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-28 09:02:02,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#true} ~cond := #in~cond; {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:02,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:02,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:02,368 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} #46#return; {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-28 09:02:02,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} assume !false; {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-28 09:02:02,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} assume !(~x~0 % 4294967296 < 10); {1364#false} is VALID [2022-04-28 09:02:02,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {1364#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1364#false} is VALID [2022-04-28 09:02:02,419 INFO L272 TraceCheckUtils]: 33: Hoare triple {1364#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1364#false} is VALID [2022-04-28 09:02:02,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {1364#false} ~cond := #in~cond; {1364#false} is VALID [2022-04-28 09:02:02,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {1364#false} assume 0 == ~cond; {1364#false} is VALID [2022-04-28 09:02:02,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-04-28 09:02:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:02:02,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:03,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100066027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:03,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:02:03,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2022-04-28 09:02:03,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071445865] [2022-04-28 09:02:03,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071445865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:03,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:03,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:02:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712366510] [2022-04-28 09:02:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-04-28 09:02:03,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:03,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:03,986 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:02:03,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:02:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:02:04,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:02:04,000 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:04,323 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-28 09:02:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:02:04,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-04-28 09:02:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 09:02:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 09:02:04,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-28 09:02:04,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:04,375 INFO L225 Difference]: With dead ends: 49 [2022-04-28 09:02:04,375 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 09:02:04,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:02:04,375 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:04,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:02:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 09:02:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-28 09:02:04,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:04,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:04,440 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:04,444 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 09:02:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 09:02:04,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:04,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:04,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-04-28 09:02:04,445 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-04-28 09:02:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:04,446 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 09:02:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 09:02:04,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:04,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:04,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:04,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-28 09:02:04,448 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 37 [2022-04-28 09:02:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:04,448 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-28 09:02:04,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:04,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2022-04-28 09:02:04,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-28 09:02:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 09:02:04,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:04,492 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:04,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 09:02:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:04,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -505363994, now seen corresponding path program 7 times [2022-04-28 09:02:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265012122] [2022-04-28 09:02:04,912 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:04,912 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -505363994, now seen corresponding path program 8 times [2022-04-28 09:02:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:04,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462025430] [2022-04-28 09:02:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {1844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-28 09:02:05,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-28 09:02:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:05,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:05,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-28 09:02:05,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-28 09:02:05,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-28 09:02:05,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {1823#(= main_~x~0 0)} assume !false; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1823#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1823#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,047 INFO L272 TraceCheckUtils]: 9: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,050 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,053 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,055 INFO L272 TraceCheckUtils]: 25: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,055 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:05,056 INFO L272 TraceCheckUtils]: 33: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,057 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:05,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:05,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-28 09:02:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:02:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:05,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462025430] [2022-04-28 09:02:05,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462025430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:05,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119620056] [2022-04-28 09:02:05,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:02:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:05,060 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:02:05,079 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:02:05,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:02:05,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:05,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:02:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:05,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:05,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-28 09:02:05,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-28 09:02:05,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-28 09:02:05,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-28 09:02:05,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {1823#(= main_~x~0 0)} assume !false; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1823#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1823#(= main_~x~0 0)} is VALID [2022-04-28 09:02:05,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1823#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,370 INFO L272 TraceCheckUtils]: 9: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,371 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:05,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,372 INFO L272 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,373 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:05,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,374 INFO L272 TraceCheckUtils]: 25: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,374 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:05,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:05,376 INFO L272 TraceCheckUtils]: 33: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,376 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:05,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:05,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-28 09:02:05,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-28 09:02:05,377 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-28 09:02:05,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-28 09:02:05,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-28 09:02:05,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-28 09:02:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:02:05,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:05,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-28 09:02:05,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-28 09:02:05,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-28 09:02:05,553 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-28 09:02:05,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-28 09:02:05,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-28 09:02:05,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} assume !false; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:05,554 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1996#(< (mod main_~x~0 4294967296) 10)} #46#return; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:05,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,555 INFO L272 TraceCheckUtils]: 33: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:05,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:05,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:05,556 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:05,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,557 INFO L272 TraceCheckUtils]: 25: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:05,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:05,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:05,558 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:05,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,559 INFO L272 TraceCheckUtils]: 17: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:05,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:05,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:05,561 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:05,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 09:02:05,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 09:02:05,561 INFO L272 TraceCheckUtils]: 9: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 09:02:05,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:05,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:05,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:05,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:05,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-28 09:02:05,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-28 09:02:05,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 09:02:05,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-28 09:02:05,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-28 09:02:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:02:05,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119620056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:05,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:05,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:02:05,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265012122] [2022-04-28 09:02:05,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265012122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:05,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:05,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:02:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609215825] [2022-04-28 09:02:05,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 09:02:05,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:05,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:05,588 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:02:05,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:02:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:02:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:02:05,589 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:06,015 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 09:02:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:02:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 09:02:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 09:02:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 09:02:06,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-28 09:02:06,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:06,067 INFO L225 Difference]: With dead ends: 53 [2022-04-28 09:02:06,067 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 09:02:06,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 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:02:06,067 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:06,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:02:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 09:02:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-28 09:02:06,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:06,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:06,167 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:06,168 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:06,171 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-28 09:02:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-28 09:02:06,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:06,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:06,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-28 09:02:06,171 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-28 09:02:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:06,172 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-28 09:02:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-28 09:02:06,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:06,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:06,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:06,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-28 09:02:06,174 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 45 [2022-04-28 09:02:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:06,174 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-28 09:02:06,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:02:06,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2022-04-28 09:02:06,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-28 09:02:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 09:02:06,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:06,253 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:06,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 09:02:06,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:06,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -736237565, now seen corresponding path program 9 times [2022-04-28 09:02:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:06,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381733011] [2022-04-28 09:02:06,678 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:06,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash -736237565, now seen corresponding path program 10 times [2022-04-28 09:02:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:06,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421185599] [2022-04-28 09:02:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-28 09:02:06,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-28 09:02:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:06,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:02:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} #46#return; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:06,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:06,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-28 09:02:06,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-28 09:02:06,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-28 09:02:06,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:06,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(= main_~x~0 0)} assume !false; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:06,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:06,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:06,787 INFO L272 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:06,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,788 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:06,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:06,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:06,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:06,789 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:06,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,790 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:06,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:06,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:06,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:06,791 INFO L272 TraceCheckUtils]: 25: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:06,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,791 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:06,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:06,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:06,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:06,793 INFO L272 TraceCheckUtils]: 33: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:06,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,793 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:06,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:06,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:06,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:06,794 INFO L272 TraceCheckUtils]: 41: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:06,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:06,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:06,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:06,795 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} #46#return; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:06,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !false; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:06,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-28 09:02:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:02:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:06,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421185599] [2022-04-28 09:02:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421185599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963550489] [2022-04-28 09:02:06,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:02:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:06,812 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:02:06,813 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:02:06,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:02:06,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:02:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:06,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:07,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-28 09:02:07,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-28 09:02:07,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-28 09:02:07,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-28 09:02:07,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:07,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(= main_~x~0 0)} assume !false; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:07,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2411#(= main_~x~0 0)} is VALID [2022-04-28 09:02:07,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:07,158 INFO L272 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,159 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:07,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:07,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:07,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:07,160 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,161 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:07,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:07,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:07,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:07,162 INFO L272 TraceCheckUtils]: 25: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,162 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:07,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:07,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:07,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:07,164 INFO L272 TraceCheckUtils]: 33: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,164 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:07,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:07,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:07,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:07,165 INFO L272 TraceCheckUtils]: 41: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,166 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:07,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:07,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-28 09:02:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:02:07,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:07,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-28 09:02:07,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-28 09:02:07,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-28 09:02:07,347 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-28 09:02:07,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-28 09:02:07,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-28 09:02:07,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} assume !false; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:07,348 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2613#(< (mod main_~x~0 4294967296) 10)} #46#return; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:07,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,348 INFO L272 TraceCheckUtils]: 41: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:07,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:07,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:07,357 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:07,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,358 INFO L272 TraceCheckUtils]: 33: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:07,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:07,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:07,359 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:07,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,359 INFO L272 TraceCheckUtils]: 25: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:07,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:07,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:07,361 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:07,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:07,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:07,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:07,365 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:07,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-28 09:02:07,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-28 09:02:07,365 INFO L272 TraceCheckUtils]: 9: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-28 09:02:07,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:07,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:07,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:07,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:07,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-28 09:02:07,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-28 09:02:07,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-28 09:02:07,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-28 09:02:07,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-28 09:02:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:02:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963550489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:07,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 09:02:07,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381733011] [2022-04-28 09:02:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381733011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:07,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:02:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381700808] [2022-04-28 09:02:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:07,393 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-04-28 09:02:07,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:07,393 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:07,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:07,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:02:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:02:07,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:02:07,428 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:07,837 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 09:02:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:02:07,837 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-04-28 09:02:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:07,837 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 09:02:07,839 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 09:02:07,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 09:02:07,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:07,880 INFO L225 Difference]: With dead ends: 57 [2022-04-28 09:02:07,880 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:02:07,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:02:07,881 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:07,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 53 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:02:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:02:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-28 09:02:07,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:07,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:07,969 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:07,969 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:07,970 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 09:02:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-28 09:02:07,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:07,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:07,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 09:02:07,971 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 09:02:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:07,972 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 09:02:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-28 09:02:07,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:07,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:07,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:07,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-28 09:02:07,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 53 [2022-04-28 09:02:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:07,974 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-28 09:02:07,974 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), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:02:07,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 53 transitions. [2022-04-28 09:02:08,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-28 09:02:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 09:02:08,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:08,033 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:08,053 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:02:08,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:08,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 764780832, now seen corresponding path program 11 times [2022-04-28 09:02:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037034403] [2022-04-28 09:02:08,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:08,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 764780832, now seen corresponding path program 12 times [2022-04-28 09:02:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:08,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514395999] [2022-04-28 09:02:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {3110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3074#true} is VALID [2022-04-28 09:02:08,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-28 09:02:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:02:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-28 09:02:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:08,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} #46#return; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:08,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:08,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3074#true} is VALID [2022-04-28 09:02:08,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-28 09:02:08,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2022-04-28 09:02:08,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3079#(= main_~x~0 0)} is VALID [2022-04-28 09:02:08,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {3079#(= main_~x~0 0)} assume !false; {3079#(= main_~x~0 0)} is VALID [2022-04-28 09:02:08,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {3079#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3079#(= main_~x~0 0)} is VALID [2022-04-28 09:02:08,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {3079#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:08,545 INFO L272 TraceCheckUtils]: 9: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,546 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3074#true} {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:08,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:08,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:08,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:08,547 INFO L272 TraceCheckUtils]: 17: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,548 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3074#true} {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:08,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:08,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:08,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:08,549 INFO L272 TraceCheckUtils]: 25: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,549 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3074#true} {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:08,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:08,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:08,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:08,550 INFO L272 TraceCheckUtils]: 33: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,551 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3074#true} {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:08,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:08,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:08,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:08,552 INFO L272 TraceCheckUtils]: 41: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,553 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3074#true} {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:08,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:08,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:08,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:08,554 INFO L272 TraceCheckUtils]: 49: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:08,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:08,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:08,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:08,554 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3074#true} {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} #46#return; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !false; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10); {3075#false} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {3075#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3075#false} is VALID [2022-04-28 09:02:08,555 INFO L272 TraceCheckUtils]: 57: Hoare triple {3075#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3075#false} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {3075#false} assume 0 == ~cond; {3075#false} is VALID [2022-04-28 09:02:08,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-04-28 09:02:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 09:02:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514395999] [2022-04-28 09:02:08,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514395999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748984203] [2022-04-28 09:02:08,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:02:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:08,557 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:02:08,558 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:02:09,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 09:02:09,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:09,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:02:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:09,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:10,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2022-04-28 09:02:10,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3074#true} is VALID [2022-04-28 09:02:10,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-28 09:02:10,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2022-04-28 09:02:10,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3129#(= main_~sn~0 0)} is VALID [2022-04-28 09:02:10,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#(= main_~sn~0 0)} assume !false; {3129#(= main_~sn~0 0)} is VALID [2022-04-28 09:02:10,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#(= main_~sn~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3136#(= 2 main_~sn~0)} is VALID [2022-04-28 09:02:10,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {3136#(= 2 main_~sn~0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3136#(= 2 main_~sn~0)} is VALID [2022-04-28 09:02:10,161 INFO L272 TraceCheckUtils]: 9: Hoare triple {3136#(= 2 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:10,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:10,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,162 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3074#true} {3136#(= 2 main_~sn~0)} #46#return; {3136#(= 2 main_~sn~0)} is VALID [2022-04-28 09:02:10,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {3136#(= 2 main_~sn~0)} assume !false; {3136#(= 2 main_~sn~0)} is VALID [2022-04-28 09:02:10,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {3136#(= 2 main_~sn~0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,163 INFO L272 TraceCheckUtils]: 17: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:10,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:10,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,163 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3074#true} {3161#(= (+ (- 2) main_~sn~0) 2)} #46#return; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} assume !false; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3186#(= (+ (- 4) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {3186#(= (+ (- 4) main_~sn~0) 2)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3186#(= (+ (- 4) main_~sn~0) 2)} is VALID [2022-04-28 09:02:10,164 INFO L272 TraceCheckUtils]: 25: Hoare triple {3186#(= (+ (- 4) main_~sn~0) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {3074#true} ~cond := #in~cond; {3196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:10,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {3196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:10,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:10,166 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} {3186#(= (+ (- 4) main_~sn~0) 2)} #46#return; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-28 09:02:10,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} assume !false; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-28 09:02:10,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-28 09:02:10,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-28 09:02:10,167 INFO L272 TraceCheckUtils]: 33: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:10,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:10,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,171 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3074#true} {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} #46#return; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-28 09:02:10,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} assume !false; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-28 09:02:10,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-28 09:02:10,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-28 09:02:10,173 INFO L272 TraceCheckUtils]: 41: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:10,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:10,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,174 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3074#true} {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} #46#return; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-28 09:02:10,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} assume !false; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-28 09:02:10,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3264#(and (< (mod main_~x~0 4294967296) 10) (= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6))} is VALID [2022-04-28 09:02:10,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {3264#(and (< (mod main_~x~0 4294967296) 10) (= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-28 09:02:10,180 INFO L272 TraceCheckUtils]: 49: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-28 09:02:10,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-28 09:02:10,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-28 09:02:10,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-28 09:02:10,181 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3074#true} {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} #46#return; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-28 09:02:10,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} assume !false; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-28 09:02:10,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} assume !(~x~0 % 4294967296 < 10); {3075#false} is VALID [2022-04-28 09:02:10,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {3075#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3075#false} is VALID [2022-04-28 09:02:10,182 INFO L272 TraceCheckUtils]: 57: Hoare triple {3075#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3075#false} is VALID [2022-04-28 09:02:10,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2022-04-28 09:02:10,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {3075#false} assume 0 == ~cond; {3075#false} is VALID [2022-04-28 09:02:10,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-04-28 09:02:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 09:02:10,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:11,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748984203] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:11,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:02:11,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2022-04-28 09:02:11,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:11,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037034403] [2022-04-28 09:02:11,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037034403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:11,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:11,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:02:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887539881] [2022-04-28 09:02:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-04-28 09:02:11,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:11,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:11,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:11,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:02:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:02:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:02:11,039 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:11,533 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 09:02:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:02:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-04-28 09:02:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 09:02:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 09:02:11,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 09:02:11,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:11,593 INFO L225 Difference]: With dead ends: 61 [2022-04-28 09:02:11,593 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:02:11,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:02:11,594 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:11,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:02:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:02:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 09:02:11,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:11,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:11,706 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:11,706 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:11,707 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 09:02:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 09:02:11,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:11,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:11,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 09:02:11,708 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 09:02:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:11,709 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 09:02:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 09:02:11,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:11,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:11,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:11,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-04-28 09:02:11,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 61 [2022-04-28 09:02:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:11,711 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-04-28 09:02:11,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:02:11,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 58 transitions. [2022-04-28 09:02:11,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-28 09:02:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 09:02:11,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:11,778 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:11,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 09:02:11,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:11,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1610935613, now seen corresponding path program 13 times [2022-04-28 09:02:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:11,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990910217] [2022-04-28 09:02:12,184 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:12,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1610935613, now seen corresponding path program 14 times [2022-04-28 09:02:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16781714] [2022-04-28 09:02:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-28 09:02:12,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-28 09:02:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:02:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-28 09:02:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-28 09:02:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} #46#return; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:02:12,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:12,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-28 09:02:12,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-28 09:02:12,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-28 09:02:12,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~x~0 0)} assume !false; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,343 INFO L272 TraceCheckUtils]: 9: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,343 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,345 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,346 INFO L272 TraceCheckUtils]: 25: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,347 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,348 INFO L272 TraceCheckUtils]: 33: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,349 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,350 INFO L272 TraceCheckUtils]: 41: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,350 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,351 INFO L272 TraceCheckUtils]: 49: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,352 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:02:12,353 INFO L272 TraceCheckUtils]: 57: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,354 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} #46#return; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:02:12,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !false; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:02:12,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 09:02:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 09:02:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:12,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16781714] [2022-04-28 09:02:12,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16781714] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:12,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574861468] [2022-04-28 09:02:12,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:02:12,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:12,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:12,357 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:02:12,381 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:02:12,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:02:12,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:12,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:02:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:12,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 09:02:12,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-28 09:02:12,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-28 09:02:12,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-28 09:02:12,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~x~0 0)} assume !false; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3749#(= main_~x~0 0)} is VALID [2022-04-28 09:02:12,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,899 INFO L272 TraceCheckUtils]: 9: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,900 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:12,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,901 INFO L272 TraceCheckUtils]: 17: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,902 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:12,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,903 INFO L272 TraceCheckUtils]: 25: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,904 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:12,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,905 INFO L272 TraceCheckUtils]: 33: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,905 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:12,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,906 INFO L272 TraceCheckUtils]: 41: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,907 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:12,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,908 INFO L272 TraceCheckUtils]: 49: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,909 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:12,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:12,910 INFO L272 TraceCheckUtils]: 57: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:12,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:12,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:12,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:12,910 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:12,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:12,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-28 09:02:12,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-28 09:02:12,911 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 09:02:12,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 09:02:12,911 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 09:02:12,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 09:02:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 09:02:12,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:13,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 09:02:13,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 09:02:13,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 09:02:13,210 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 09:02:13,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-28 09:02:13,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-28 09:02:13,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} assume !false; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:13,215 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {4009#(< (mod main_~x~0 4294967296) 10)} #46#return; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:13,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,215 INFO L272 TraceCheckUtils]: 57: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:13,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:13,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:13,218 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:13,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,219 INFO L272 TraceCheckUtils]: 49: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:13,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:13,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:13,222 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:13,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,223 INFO L272 TraceCheckUtils]: 41: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:13,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:13,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:13,224 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:13,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,225 INFO L272 TraceCheckUtils]: 33: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:13,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:13,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:13,226 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:13,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,227 INFO L272 TraceCheckUtils]: 25: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:13,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,228 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,229 INFO L272 TraceCheckUtils]: 17: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:13,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:13,230 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:13,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 09:02:13,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 09:02:13,231 INFO L272 TraceCheckUtils]: 9: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 09:02:13,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:13,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:13,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-28 09:02:13,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-28 09:02:13,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 09:02:13,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-28 09:02:13,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 09:02:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 09:02:13,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574861468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:13,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 09:02:13,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:13,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990910217] [2022-04-28 09:02:13,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990910217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:13,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:02:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118724178] [2022-04-28 09:02:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-04-28 09:02:13,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:13,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:13,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:02:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:02:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:02:13,272 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:13,967 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 09:02:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:02:13,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-04-28 09:02:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-28 09:02:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-28 09:02:13,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-28 09:02:14,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:14,026 INFO L225 Difference]: With dead ends: 65 [2022-04-28 09:02:14,026 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 09:02:14,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:02:14,027 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:14,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 37 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:02:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 09:02:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 09:02:14,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:14,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:14,173 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:14,174 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,175 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-28 09:02:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-28 09:02:14,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 55 states. [2022-04-28 09:02:14,176 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 55 states. [2022-04-28 09:02:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,177 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-28 09:02:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-28 09:02:14,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:14,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-28 09:02:14,179 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 69 [2022-04-28 09:02:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:14,180 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-28 09:02:14,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 09:02:14,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-28 09:02:14,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 09:02:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 09:02:14,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:14,253 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:14,271 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:02:14,454 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,SelfDestructingSolverStorable8 [2022-04-28 09:02:14,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 15 times [2022-04-28 09:02:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:14,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1873041670] [2022-04-28 09:02:14,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:14,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 16 times [2022-04-28 09:02:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:14,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649000408] [2022-04-28 09:02:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {4618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-28 09:02:14,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-28 09:02:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:02:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-28 09:02:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-28 09:02:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:02:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:14,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:14,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:14,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {4618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-28 09:02:14,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-28 09:02:14,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-28 09:02:14,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:14,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {4577#(= main_~x~0 0)} assume !false; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:14,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:14,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:14,903 INFO L272 TraceCheckUtils]: 9: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,903 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:14,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:14,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:14,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:14,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,904 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:14,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:14,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:14,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:14,905 INFO L272 TraceCheckUtils]: 25: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,906 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:14,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:14,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:14,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:14,907 INFO L272 TraceCheckUtils]: 33: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,907 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:14,908 INFO L272 TraceCheckUtils]: 41: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,909 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:14,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:14,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:14,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:14,909 INFO L272 TraceCheckUtils]: 49: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,910 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:14,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:14,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:14,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:14,912 INFO L272 TraceCheckUtils]: 57: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,912 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:14,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:14,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:14,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:14,913 INFO L272 TraceCheckUtils]: 65: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:14,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:14,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:14,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:14,913 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 71: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-28 09:02:14,914 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-28 09:02:14,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-28 09:02:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 09:02:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649000408] [2022-04-28 09:02:14,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649000408] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380328615] [2022-04-28 09:02:14,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:02:14,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:14,916 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:02:14,917 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:02:14,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:02:14,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:14,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:02:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:15,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:15,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4572#true} is VALID [2022-04-28 09:02:15,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-28 09:02:15,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-28 09:02:15,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-28 09:02:15,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:15,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {4577#(= main_~x~0 0)} assume !false; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:15,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4577#(= main_~x~0 0)} is VALID [2022-04-28 09:02:15,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:15,305 INFO L272 TraceCheckUtils]: 9: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,306 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:15,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:15,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:15,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:15,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,307 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:15,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:15,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:15,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:15,308 INFO L272 TraceCheckUtils]: 25: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,309 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:15,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:15,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:15,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:15,310 INFO L272 TraceCheckUtils]: 33: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,310 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:15,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:15,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:15,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:15,311 INFO L272 TraceCheckUtils]: 41: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,312 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:15,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:15,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:15,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:15,312 INFO L272 TraceCheckUtils]: 49: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,313 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:15,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:15,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:15,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:15,314 INFO L272 TraceCheckUtils]: 57: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,314 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:15,315 INFO L272 TraceCheckUtils]: 65: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,316 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:15,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:15,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-28 09:02:15,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-28 09:02:15,316 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-28 09:02:15,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-28 09:02:15,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-28 09:02:15,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-28 09:02:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 09:02:15,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:15,550 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-28 09:02:15,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-28 09:02:15,551 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-28 09:02:15,551 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-28 09:02:15,551 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-28 09:02:15,551 INFO L290 TraceCheckUtils]: 71: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-28 09:02:15,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} assume !false; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:15,552 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4866#(< (mod main_~x~0 4294967296) 10)} #46#return; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:15,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,552 INFO L272 TraceCheckUtils]: 65: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:15,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:15,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:15,556 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:15,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,556 INFO L272 TraceCheckUtils]: 57: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:15,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:15,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:15,558 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:15,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,558 INFO L272 TraceCheckUtils]: 49: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:15,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:15,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:15,559 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:15,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,560 INFO L272 TraceCheckUtils]: 41: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:15,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:15,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:15,561 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:15,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,561 INFO L272 TraceCheckUtils]: 33: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:15,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,562 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,563 INFO L272 TraceCheckUtils]: 25: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:15,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:15,564 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:15,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,565 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #46#return; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-28 09:02:15,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-28 09:02:15,566 INFO L272 TraceCheckUtils]: 9: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-28 09:02:15,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:15,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:15,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume !false; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:15,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:15,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-28 09:02:15,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-28 09:02:15,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-28 09:02:15,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-28 09:02:15,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4572#true} is VALID [2022-04-28 09:02:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 09:02:15,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380328615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:15,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:15,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 09:02:15,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:15,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1873041670] [2022-04-28 09:02:15,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1873041670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:15,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:15,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:02:15,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066690774] [2022-04-28 09:02:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-04-28 09:02:15,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:15,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:15,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:15,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:02:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:15,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:02:15,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:02:15,593 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:16,303 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-28 09:02:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:02:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-04-28 09:02:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-28 09:02:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-28 09:02:16,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-04-28 09:02:16,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:16,359 INFO L225 Difference]: With dead ends: 69 [2022-04-28 09:02:16,359 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 09:02:16,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:02:16,360 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:16,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:02:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 09:02:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 09:02:16,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:16,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 09:02:16,504 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 09:02:16,504 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 09:02:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:16,507 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 09:02:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 09:02:16,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:16,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:16,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 59 states. [2022-04-28 09:02:16,507 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 59 states. [2022-04-28 09:02:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:16,508 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 09:02:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 09:02:16,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:16,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:16,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:16,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 09:02:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-28 09:02:16,510 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 77 [2022-04-28 09:02:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:16,510 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-28 09:02:16,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 09:02:16,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-28 09:02:16,591 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:02:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-28 09:02:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 09:02:16,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:16,592 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:16,609 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:02:16,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 09:02:16,792 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -708952457, now seen corresponding path program 17 times [2022-04-28 09:02:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:16,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1526975138] [2022-04-28 09:02:17,017 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:17,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -708952457, now seen corresponding path program 18 times [2022-04-28 09:02:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688105815] [2022-04-28 09:02:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {5531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-28 09:02:17,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-28 09:02:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:02:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:02:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 09:02:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:02:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 09:02:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-28 09:02:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-28 09:02:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:02:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-28 09:02:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:17,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:17,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {5531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-28 09:02:17,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-28 09:02:17,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-28 09:02:17,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:17,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#(= main_~x~0 0)} assume !false; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:17,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:17,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {5485#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:17,197 INFO L272 TraceCheckUtils]: 9: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,198 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:17,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:17,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:17,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:17,199 INFO L272 TraceCheckUtils]: 17: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,200 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:17,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:17,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:17,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:17,201 INFO L272 TraceCheckUtils]: 25: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,201 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:17,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:17,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:17,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:17,203 INFO L272 TraceCheckUtils]: 33: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,203 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:17,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:17,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:17,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:17,204 INFO L272 TraceCheckUtils]: 41: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,205 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:17,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:17,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:17,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:17,206 INFO L272 TraceCheckUtils]: 49: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,206 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,206 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:17,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:17,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:17,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:17,208 INFO L272 TraceCheckUtils]: 57: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,208 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:17,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:17,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:17,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:17,209 INFO L272 TraceCheckUtils]: 65: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,210 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:17,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:17,210 INFO L290 TraceCheckUtils]: 71: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:17,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:17,211 INFO L272 TraceCheckUtils]: 73: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:17,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:17,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:17,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:17,212 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:17,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:02:17,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-28 09:02:17,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-28 09:02:17,213 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-28 09:02:17,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-28 09:02:17,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-28 09:02:17,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-28 09:02:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 09:02:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688105815] [2022-04-28 09:02:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688105815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339488200] [2022-04-28 09:02:17,213 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:02:17,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:17,228 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:02:17,257 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:02:17,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 09:02:17,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:17,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:02:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:17,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:18,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5480#true} is VALID [2022-04-28 09:02:18,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-28 09:02:18,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-28 09:02:18,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-28 09:02:18,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:18,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#(= main_~x~0 0)} assume !false; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:18,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5485#(= main_~x~0 0)} is VALID [2022-04-28 09:02:18,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {5485#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:18,241 INFO L272 TraceCheckUtils]: 9: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,242 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:18,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:18,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:02:18,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:18,243 INFO L272 TraceCheckUtils]: 17: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,244 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:18,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:18,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:18,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:18,245 INFO L272 TraceCheckUtils]: 25: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,246 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:18,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:18,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:02:18,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:18,247 INFO L272 TraceCheckUtils]: 33: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,247 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:18,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:18,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:02:18,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:18,249 INFO L272 TraceCheckUtils]: 41: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,249 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:18,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:18,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:02:18,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:18,250 INFO L272 TraceCheckUtils]: 49: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,251 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:18,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:18,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:02:18,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:18,252 INFO L272 TraceCheckUtils]: 57: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,253 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:18,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:18,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:02:18,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:18,254 INFO L272 TraceCheckUtils]: 65: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,255 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:18,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:18,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:02:18,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:02:18,256 INFO L272 TraceCheckUtils]: 73: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,256 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #46#return; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:02:18,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !false; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:02:18,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-28 09:02:18,257 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-28 09:02:18,257 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-28 09:02:18,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-28 09:02:18,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-28 09:02:18,258 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-28 09:02:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 09:02:18,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:18,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-28 09:02:18,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} assume !false; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:18,546 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5803#(< (mod main_~x~0 4294967296) 10)} #46#return; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:18,546 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,546 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,546 INFO L272 TraceCheckUtils]: 73: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,546 INFO L290 TraceCheckUtils]: 72: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-28 09:02:18,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:18,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:18,547 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:18,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,547 INFO L272 TraceCheckUtils]: 65: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-28 09:02:18,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:18,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:18,549 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:18,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,549 INFO L272 TraceCheckUtils]: 57: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-28 09:02:18,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:18,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:18,550 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:18,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,550 INFO L272 TraceCheckUtils]: 49: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-28 09:02:18,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:18,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:18,552 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:18,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,552 INFO L272 TraceCheckUtils]: 41: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-28 09:02:18,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,553 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,553 INFO L272 TraceCheckUtils]: 33: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:18,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:18,555 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:18,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,555 INFO L272 TraceCheckUtils]: 25: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-28 09:02:18,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,556 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #46#return; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-28 09:02:18,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:18,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume !false; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:18,558 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} #46#return; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:18,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-28 09:02:18,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-28 09:02:18,558 INFO L272 TraceCheckUtils]: 9: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-28 09:02:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-28 09:02:18,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-28 09:02:18,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} assume !false; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-28 09:02:18,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-28 09:02:18,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-28 09:02:18,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-28 09:02:18,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 09:02:18,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-28 09:02:18,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5480#true} is VALID [2022-04-28 09:02:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 09:02:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339488200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:18,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:18,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 09:02:18,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:18,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1526975138] [2022-04-28 09:02:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1526975138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:18,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:18,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:02:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077942827] [2022-04-28 09:02:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-04-28 09:02:18,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:18,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:18,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:18,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:02:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:02:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:02:18,590 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:19,559 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 09:02:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:02:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-04-28 09:02:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-28 09:02:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-28 09:02:19,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2022-04-28 09:02:19,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:19,597 INFO L225 Difference]: With dead ends: 73 [2022-04-28 09:02:19,597 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:02:19,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:02:19,598 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:19,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 81 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:02:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:02:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 09:02:19,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:19,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:02:19,737 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:02:19,737 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:02:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:19,738 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-28 09:02:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-28 09:02:19,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:19,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:19,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 09:02:19,739 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 09:02:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:19,740 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-28 09:02:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-28 09:02:19,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:19,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:19,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:19,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:02:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-04-28 09:02:19,752 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 85 [2022-04-28 09:02:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:19,752 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-04-28 09:02:19,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 09:02:19,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 73 transitions. [2022-04-28 09:02:19,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-28 09:02:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 09:02:19,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:19,818 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:19,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 09:02:20,019 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,SelfDestructingSolverStorable10 [2022-04-28 09:02:20,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 19 times [2022-04-28 09:02:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060964651] [2022-04-28 09:02:20,161 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:20,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 20 times [2022-04-28 09:02:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:20,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343410794] [2022-04-28 09:02:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:02:20,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:02:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:02:20,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:02:20,353 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:02:20,353 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:02:20,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:02:20,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 09:02:20,358 INFO L356 BasicCegarLoop]: Path program histogram: [20, 2, 2] [2022-04-28 09:02:20,361 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:02:20,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 09:02:20,375 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 09:02:20,375 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:02:20,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:02:20 BoogieIcfgContainer [2022-04-28 09:02:20,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:02:20,377 INFO L158 Benchmark]: Toolchain (without parser) took 26202.72ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 124.8MB in the beginning and 113.9MB in the end (delta: 10.9MB). Peak memory consumption was 88.8MB. Max. memory is 8.0GB. [2022-04-28 09:02:20,383 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 141.3MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:02:20,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.67ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 124.7MB in the beginning and 186.4MB in the end (delta: -61.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-28 09:02:20,387 INFO L158 Benchmark]: Boogie Preprocessor took 29.83ms. Allocated memory is still 209.7MB. Free memory was 186.4MB in the beginning and 185.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:02:20,387 INFO L158 Benchmark]: RCFGBuilder took 204.33ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 174.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:02:20,387 INFO L158 Benchmark]: TraceAbstraction took 25744.76ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 173.8MB in the beginning and 113.9MB in the end (delta: 59.9MB). Peak memory consumption was 102.4MB. Max. memory is 8.0GB. [2022-04-28 09:02:20,390 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.12ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 141.3MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.67ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 124.7MB in the beginning and 186.4MB in the end (delta: -61.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.83ms. Allocated memory is still 209.7MB. Free memory was 186.4MB in the beginning and 185.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 204.33ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 174.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25744.76ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 173.8MB in the beginning and 113.9MB in the end (delta: 59.9MB). Peak memory consumption was 102.4MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND FALSE !(x<10) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND TRUE !(cond) [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1778 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 212 mSDtfsCounter, 1778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 967 SyntacticMatches, 10 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=11, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 09:02:20,408 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...