/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:13:13,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:13:13,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:13:13,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:13:13,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:13:13,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:13:13,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:13:13,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:13:13,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:13:13,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:13:13,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:13:13,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:13:13,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:13:13,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:13:13,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:13:13,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:13:13,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:13:13,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:13:13,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:13:13,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:13:13,368 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:13:13,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:13:13,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:13:13,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:13:13,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:13:13,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:13:13,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:13:13,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:13:13,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:13:13,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:13:13,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:13:13,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:13:13,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:13:13,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:13:13,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:13:13,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:13:13,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:13:13,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:13:13,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:13:13,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:13:13,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:13:13,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:13:13,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:13:13,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:13:13,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:13:13,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:13:13,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:13:13,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:13:13,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:13:13,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:13:13,417 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:13:13,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:13:13,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:13:13,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:13:13,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:13:13,717 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:13:13,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2022-04-15 06:13:13,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738a5d41d/64d68bd44623409481b9976bdda94f11/FLAG3399171a1 [2022-04-15 06:13:14,202 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:13:14,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2022-04-15 06:13:14,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738a5d41d/64d68bd44623409481b9976bdda94f11/FLAG3399171a1 [2022-04-15 06:13:14,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738a5d41d/64d68bd44623409481b9976bdda94f11 [2022-04-15 06:13:14,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:13:14,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:13:14,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:13:14,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:13:14,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:13:14,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41207f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14, skipping insertion in model container [2022-04-15 06:13:14,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:13:14,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:13:14,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i[895,908] [2022-04-15 06:13:14,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:13:14,433 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:13:14,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i[895,908] [2022-04-15 06:13:14,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:13:14,459 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:13:14,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14 WrapperNode [2022-04-15 06:13:14,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:13:14,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:13:14,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:13:14,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:13:14,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:13:14,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:13:14,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:13:14,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:13:14,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (1/1) ... [2022-04-15 06:13:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:13:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:14,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:13:14,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:13:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:13:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:13:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:13:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:13:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:13:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:13:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:13:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:13:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:13:14,612 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:13:14,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:13:14,796 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:13:14,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:13:14,802 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:13:14,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:13:14 BoogieIcfgContainer [2022-04-15 06:13:14,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:13:14,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:13:14,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:13:14,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:13:14,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:13:14" (1/3) ... [2022-04-15 06:13:14,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b44059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:13:14, skipping insertion in model container [2022-04-15 06:13:14,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:13:14" (2/3) ... [2022-04-15 06:13:14,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b44059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:13:14, skipping insertion in model container [2022-04-15 06:13:14,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:13:14" (3/3) ... [2022-04-15 06:13:14,829 INFO L111 eAbstractionObserver]: Analyzing ICFG gr2006.i [2022-04-15 06:13:14,833 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:13:14,833 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:13:14,910 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:13:14,919 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:13:14,919 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:13:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:13:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:13:14,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:14,955 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:14,956 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1795296022, now seen corresponding path program 1 times [2022-04-15 06:13:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:14,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334761728] [2022-04-15 06:13:14,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:13:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1795296022, now seen corresponding path program 2 times [2022-04-15 06:13:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:14,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120158963] [2022-04-15 06:13:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-15 06:13:15,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:13:15,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #61#return; {24#true} is VALID [2022-04-15 06:13:15,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:15,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-15 06:13:15,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:13:15,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #61#return; {24#true} is VALID [2022-04-15 06:13:15,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2022-04-15 06:13:15,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24#true} is VALID [2022-04-15 06:13:15,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:13:15,200 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25#false} is VALID [2022-04-15 06:13:15,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:13:15,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:13:15,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:13:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120158963] [2022-04-15 06:13:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120158963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:13:15,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334761728] [2022-04-15 06:13:15,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334761728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:13:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870965082] [2022-04-15 06:13:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:13:15,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:15,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:13:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:13:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:13:15,265 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,340 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 06:13:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:13:15,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:13:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-15 06:13:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-15 06:13:15,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-15 06:13:15,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,400 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:13:15,400 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:13:15,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:13:15,405 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:15,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:13:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:13:15,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:15,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,431 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,432 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,434 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:13:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:13:15,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:13:15,435 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:13:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,437 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 06:13:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:13:15,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:15,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 06:13:15,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 06:13:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:15,441 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 06:13:15,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 06:13:15,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 06:13:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:13:15,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:15,459 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:15,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:13:15,460 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1744532035, now seen corresponding path program 1 times [2022-04-15 06:13:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509965527] [2022-04-15 06:13:15,461 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:13:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1744532035, now seen corresponding path program 2 times [2022-04-15 06:13:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449841880] [2022-04-15 06:13:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {154#true} is VALID [2022-04-15 06:13:15,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:13:15,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #61#return; {154#true} is VALID [2022-04-15 06:13:15,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:15,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {154#true} is VALID [2022-04-15 06:13:15,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 06:13:15,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #61#return; {154#true} is VALID [2022-04-15 06:13:15,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret4 := main(); {154#true} is VALID [2022-04-15 06:13:15,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {159#(= main_~y~0 0)} is VALID [2022-04-15 06:13:15,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~y~0 0)} assume !false; {159#(= main_~y~0 0)} is VALID [2022-04-15 06:13:15,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(= main_~y~0 0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {160#(<= 1 main_~y~0)} is VALID [2022-04-15 06:13:15,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(<= 1 main_~y~0)} assume ~y~0 < 0; {155#false} is VALID [2022-04-15 06:13:15,527 INFO L272 TraceCheckUtils]: 9: Hoare triple {155#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {155#false} is VALID [2022-04-15 06:13:15,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} ~cond := #in~cond; {155#false} is VALID [2022-04-15 06:13:15,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume 0 == ~cond; {155#false} is VALID [2022-04-15 06:13:15,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 06:13:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:15,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449841880] [2022-04-15 06:13:15,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449841880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:13:15,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:15,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509965527] [2022-04-15 06:13:15,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509965527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:13:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63019921] [2022-04-15 06:13:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:13:15,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:15,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:13:15,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:13:15,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:13:15,544 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,641 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 06:13:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:13:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:13:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 06:13:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 06:13:15,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 06:13:15,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,672 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:13:15,673 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:13:15,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:13:15,674 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:15,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:13:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-15 06:13:15,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:15,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,683 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,683 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,685 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 06:13:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:13:15,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:13:15,686 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:13:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,687 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 06:13:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:13:15,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:15,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:13:15,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 06:13:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:15,690 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:13:15,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:13:15,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:13:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:13:15,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:15,710 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:15,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:13:15,710 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1801790337, now seen corresponding path program 1 times [2022-04-15 06:13:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733613488] [2022-04-15 06:13:15,712 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:13:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1801790337, now seen corresponding path program 2 times [2022-04-15 06:13:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:15,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153101714] [2022-04-15 06:13:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:15,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {288#true} is VALID [2022-04-15 06:13:15,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-15 06:13:15,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #61#return; {288#true} is VALID [2022-04-15 06:13:15,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:15,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {288#true} is VALID [2022-04-15 06:13:15,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-15 06:13:15,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #61#return; {288#true} is VALID [2022-04-15 06:13:15,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret4 := main(); {288#true} is VALID [2022-04-15 06:13:15,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {293#(= main_~x~0 0)} is VALID [2022-04-15 06:13:15,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(= main_~x~0 0)} assume !false; {293#(= main_~x~0 0)} is VALID [2022-04-15 06:13:15,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(= main_~x~0 0)} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {289#false} is VALID [2022-04-15 06:13:15,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume ~y~0 < 0; {289#false} is VALID [2022-04-15 06:13:15,761 INFO L272 TraceCheckUtils]: 9: Hoare triple {289#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {289#false} is VALID [2022-04-15 06:13:15,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-15 06:13:15,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-15 06:13:15,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-15 06:13:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153101714] [2022-04-15 06:13:15,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153101714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:13:15,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:15,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [733613488] [2022-04-15 06:13:15,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [733613488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:15,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:15,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:13:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297954126] [2022-04-15 06:13:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:13:15,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:15,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:13:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:13:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:13:15,778 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,836 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 06:13:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:13:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:13:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 06:13:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 06:13:15,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 06:13:15,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,866 INFO L225 Difference]: With dead ends: 28 [2022-04-15 06:13:15,866 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:13:15,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:13:15,868 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:15,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:13:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 06:13:15,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:15,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,879 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,880 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,882 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:15,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:15,884 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:15,886 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:15,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:15,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:15,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:15,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 06:13:15,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2022-04-15 06:13:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:15,895 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 06:13:15,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:15,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 06:13:15,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:13:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:13:15,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:15,919 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:15,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:13:15,919 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 799073317, now seen corresponding path program 1 times [2022-04-15 06:13:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3638127] [2022-04-15 06:13:16,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:16,385 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -677716756, now seen corresponding path program 1 times [2022-04-15 06:13:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:16,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701181957] [2022-04-15 06:13:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:16,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {433#true} is VALID [2022-04-15 06:13:16,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#true} assume true; {433#true} is VALID [2022-04-15 06:13:16,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {433#true} {433#true} #61#return; {433#true} is VALID [2022-04-15 06:13:16,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {433#true} call ULTIMATE.init(); {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:16,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {433#true} is VALID [2022-04-15 06:13:16,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#true} assume true; {433#true} is VALID [2022-04-15 06:13:16,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {433#true} {433#true} #61#return; {433#true} is VALID [2022-04-15 06:13:16,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {433#true} call #t~ret4 := main(); {433#true} is VALID [2022-04-15 06:13:16,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {438#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:16,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#(and (= main_~x~0 0) (= main_~y~0 0))} [65] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_11 1))) (.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse2 (= |v_main_#t~post1_4| |v_main_#t~post1_3|)) (.cse3 (= v_main_~y~0_11 v_main_~y~0_10))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_11 50)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_11 v_main_~y~0_10))) (and (< v_main_~y~0_11 v_main_~y~0_10) (= (+ v_main_~x~0_10 v_main_~y~0_11) .cse5) (< .cse5 (+ v_main_~y~0_11 51)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_11, main_#t~post1=|v_main_#t~post1_4|} OutVars{main_~y~0=v_main_~y~0_10, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_10, main_#t~post1=|v_main_#t~post1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:13:16,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} [64] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:13:16,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {440#(and (<= 49 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-15 06:13:16,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {440#(and (<= 49 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {434#false} is VALID [2022-04-15 06:13:16,483 INFO L272 TraceCheckUtils]: 10: Hoare triple {434#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {434#false} is VALID [2022-04-15 06:13:16,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#false} ~cond := #in~cond; {434#false} is VALID [2022-04-15 06:13:16,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#false} assume 0 == ~cond; {434#false} is VALID [2022-04-15 06:13:16,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#false} assume !false; {434#false} is VALID [2022-04-15 06:13:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:16,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701181957] [2022-04-15 06:13:16,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701181957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:16,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:16,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:13:16,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3638127] [2022-04-15 06:13:16,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3638127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:16,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:16,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:13:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900607737] [2022-04-15 06:13:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:13:16,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:16,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:16,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:13:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:13:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:13:16,649 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:16,883 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 06:13:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:13:16,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:13:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 06:13:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 06:13:16,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-15 06:13:16,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:16,922 INFO L225 Difference]: With dead ends: 25 [2022-04-15 06:13:16,922 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:13:16,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:13:16,925 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:16,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:13:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:13:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:13:16,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:16,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,943 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,944 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:16,949 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:16,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:16,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:16,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:16,950 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:16,953 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:16,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:16,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:16,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:16,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 06:13:16,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-04-15 06:13:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:16,957 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 06:13:16,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:16,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 06:13:16,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:13:16,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:16,981 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:16,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:13:16,981 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 976674245, now seen corresponding path program 2 times [2022-04-15 06:13:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:16,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699790297] [2022-04-15 06:13:17,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:20,698 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:20,905 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:20,906 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1831905421, now seen corresponding path program 1 times [2022-04-15 06:13:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546518018] [2022-04-15 06:13:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:20,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-15 06:13:20,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 06:13:20,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-15 06:13:20,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:20,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-15 06:13:20,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 06:13:20,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-15 06:13:20,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-15 06:13:20,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {590#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:20,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {590#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {591#(= main_~y~0 0)} is VALID [2022-04-15 06:13:20,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~y~0 0)} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#(= main_~y~0 0)} is VALID [2022-04-15 06:13:21,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~y~0 0)} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {592#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:21,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 0 main_~y~0)} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:21,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 0 main_~y~0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {593#(<= 1 main_~y~0)} is VALID [2022-04-15 06:13:21,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-15 06:13:21,005 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-15 06:13:21,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-15 06:13:21,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-15 06:13:21,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-15 06:13:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:21,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546518018] [2022-04-15 06:13:21,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546518018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:21,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550423482] [2022-04-15 06:13:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:21,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:21,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:13:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:21,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:21,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:21,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-15 06:13:21,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-15 06:13:21,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 06:13:21,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-15 06:13:21,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-15 06:13:21,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:21,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:21,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:21,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {592#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:21,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 0 main_~y~0)} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:21,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 0 main_~y~0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {593#(<= 1 main_~y~0)} is VALID [2022-04-15 06:13:21,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-15 06:13:21,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-15 06:13:21,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-15 06:13:21,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-15 06:13:21,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-15 06:13:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:21,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:21,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-15 06:13:21,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-15 06:13:21,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-15 06:13:21,525 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-15 06:13:21,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= 0 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-15 06:13:21,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {659#(<= 0 (+ main_~y~0 1))} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {592#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:21,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-15 06:13:21,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-15 06:13:21,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-15 06:13:21,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-15 06:13:21,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-15 06:13:21,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-15 06:13:21,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-15 06:13:21,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 06:13:21,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-15 06:13:21,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-15 06:13:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:13:21,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550423482] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:21,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:13:21,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 9 [2022-04-15 06:13:21,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:21,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699790297] [2022-04-15 06:13:21,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699790297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:21,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:13:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089153657] [2022-04-15 06:13:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:13:21,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:21,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:21,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:13:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:21,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:13:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:13:21,731 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:21,870 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 06:13:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:13:21,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:13:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-15 06:13:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-15 06:13:21,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-15 06:13:21,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:21,905 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:13:21,905 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:13:21,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:13:21,906 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:21,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:13:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 06:13:21,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:21,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,948 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,949 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:21,950 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:13:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:13:21,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:21,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:21,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:13:21,954 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:13:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:21,956 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:13:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:13:21,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:21,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:21,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:21,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-15 06:13:21,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-04-15 06:13:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:21,962 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-15 06:13:21,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:21,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-15 06:13:21,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 06:13:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:13:21,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:21,998 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:22,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:22,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:22,212 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1033932547, now seen corresponding path program 3 times [2022-04-15 06:13:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:22,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998532324] [2022-04-15 06:13:22,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:22,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:22,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 99580619, now seen corresponding path program 1 times [2022-04-15 06:13:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:22,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376188374] [2022-04-15 06:13:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:23,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-15 06:13:23,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 06:13:23,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-15 06:13:23,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:23,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-15 06:13:23,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 06:13:23,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-15 06:13:23,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-15 06:13:23,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:23,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:23,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:23,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:23,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:23,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {879#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:23,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= 0 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-15 06:13:23,054 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-15 06:13:23,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-15 06:13:23,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-15 06:13:23,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-15 06:13:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376188374] [2022-04-15 06:13:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376188374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547448620] [2022-04-15 06:13:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:23,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:23,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:13:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:23,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:23,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:23,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-15 06:13:23,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-15 06:13:23,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 06:13:23,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-15 06:13:23,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-15 06:13:23,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {899#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:23,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#(<= main_~x~0 0)} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {899#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:23,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(<= main_~x~0 0)} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {899#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:23,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#(<= main_~x~0 0)} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:23,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:23,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {916#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:23,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {916#(<= 48 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-15 06:13:23,288 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-15 06:13:23,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-15 06:13:23,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-15 06:13:23,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-15 06:13:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:23,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:23,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-15 06:13:23,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-15 06:13:23,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-15 06:13:23,709 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-15 06:13:23,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= 0 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-15 06:13:23,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {879#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:23,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:23,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:23,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:23,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {961#(<= main_~x~0 48)} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:23,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {961#(<= main_~x~0 48)} is VALID [2022-04-15 06:13:23,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-15 06:13:23,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-15 06:13:23,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 06:13:23,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-15 06:13:23,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-15 06:13:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:23,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547448620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:23,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:23,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:13:23,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998532324] [2022-04-15 06:13:23,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998532324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:23,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:23,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:13:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029601055] [2022-04-15 06:13:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:13:23,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:23,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:23,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:23,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:13:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:13:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:13:23,819 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:24,042 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 06:13:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:13:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:13:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:13:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:13:24,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-15 06:13:24,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:24,075 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:13:24,075 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:13:24,076 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:13:24,076 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:24,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:13:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:13:24,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:24,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,120 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,120 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:24,121 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:13:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:13:24,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:24,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:24,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:13:24,122 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:13:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:24,123 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:13:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:13:24,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:24,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:24,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:24,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-15 06:13:24,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2022-04-15 06:13:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:24,125 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-15 06:13:24,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:24,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-15 06:13:24,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:13:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:13:24,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:24,156 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:24,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:24,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 06:13:24,363 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 965362855, now seen corresponding path program 4 times [2022-04-15 06:13:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:24,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609999352] [2022-04-15 06:13:28,542 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:28,755 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:29,041 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:29,043 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1690002485, now seen corresponding path program 1 times [2022-04-15 06:13:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:29,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097855162] [2022-04-15 06:13:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:29,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-15 06:13:29,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-15 06:13:29,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-15 06:13:29,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:29,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-15 06:13:29,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-15 06:13:29,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-15 06:13:29,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-15 06:13:29,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1203#(= main_~x~0 0)} is VALID [2022-04-15 06:13:29,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#(= main_~x~0 0)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1203#(= main_~x~0 0)} is VALID [2022-04-15 06:13:29,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(= main_~x~0 0)} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1203#(= main_~x~0 0)} is VALID [2022-04-15 06:13:29,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(= main_~x~0 0)} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:29,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:29,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1205#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:29,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {1205#(<= 48 main_~y~0)} assume ~y~0 < 0; {1199#false} is VALID [2022-04-15 06:13:29,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-15 06:13:29,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-15 06:13:29,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-15 06:13:29,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-15 06:13:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:29,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097855162] [2022-04-15 06:13:29,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097855162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:29,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208858494] [2022-04-15 06:13:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:29,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:13:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:29,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:29,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:29,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2022-04-15 06:13:29,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-15 06:13:29,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-15 06:13:29,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-15 06:13:29,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-15 06:13:29,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1225#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:29,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {1225#(<= main_~x~0 0)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1225#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:29,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {1225#(<= main_~x~0 0)} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:29,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {1225#(<= main_~x~0 0)} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:29,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:29,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1205#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:29,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {1205#(<= 48 main_~y~0)} assume ~y~0 < 0; {1199#false} is VALID [2022-04-15 06:13:29,379 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-15 06:13:29,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-15 06:13:29,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-15 06:13:29,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-15 06:13:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:29,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:29,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-15 06:13:29,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-15 06:13:29,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-15 06:13:29,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-15 06:13:29,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(not (< main_~y~0 0))} assume ~y~0 < 0; {1199#false} is VALID [2022-04-15 06:13:29,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1269#(not (< main_~y~0 0))} is VALID [2022-04-15 06:13:29,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:29,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:29,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:29,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#(<= main_~x~0 48)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:29,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1287#(<= main_~x~0 48)} is VALID [2022-04-15 06:13:29,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-15 06:13:29,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-15 06:13:29,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-15 06:13:29,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-15 06:13:29,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2022-04-15 06:13:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:29,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208858494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:29,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:29,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:13:29,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609999352] [2022-04-15 06:13:29,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609999352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:29,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:29,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:13:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433362528] [2022-04-15 06:13:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:29,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:13:29,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:29,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:29,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:29,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:13:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:13:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:13:29,975 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:30,300 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-15 06:13:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:13:30,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:13:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:13:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:13:30,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-15 06:13:30,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:30,335 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:13:30,335 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:13:30,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:13:30,336 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:30,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:13:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:13:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 06:13:30,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:30,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,382 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,382 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:30,385 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:13:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:13:30,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:30,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:30,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:13:30,386 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:13:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:30,388 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:13:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:13:30,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:30,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:30,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:30,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 06:13:30,390 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2022-04-15 06:13:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:30,391 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 06:13:30,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:30,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 06:13:30,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 06:13:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:13:30,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:30,430 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:30,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:30,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:30,644 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1684865917, now seen corresponding path program 5 times [2022-04-15 06:13:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888405707] [2022-04-15 06:13:31,124 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:31,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:31,395 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 815381707, now seen corresponding path program 1 times [2022-04-15 06:13:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747215676] [2022-04-15 06:13:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-15 06:13:31,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-15 06:13:31,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-15 06:13:31,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-15 06:13:31,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-15 06:13:31,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-15 06:13:31,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-15 06:13:31,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1550#(= main_~x~0 0)} is VALID [2022-04-15 06:13:31,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#(= main_~x~0 0)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1551#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:31,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(<= main_~x~0 0)} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:31,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1551#(<= main_~x~0 0)} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:31,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:31,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1553#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:31,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1553#(<= 48 main_~y~0)} assume ~y~0 < 0; {1546#false} is VALID [2022-04-15 06:13:31,466 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-15 06:13:31,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-15 06:13:31,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-15 06:13:31,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-15 06:13:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:31,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747215676] [2022-04-15 06:13:31,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747215676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124291279] [2022-04-15 06:13:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:31,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:31,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:31,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:13:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:31,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:31,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2022-04-15 06:13:31,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-15 06:13:31,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-15 06:13:31,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-15 06:13:31,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-15 06:13:31,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1551#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:31,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {1551#(<= main_~x~0 0)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1551#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:31,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(<= main_~x~0 0)} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:31,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {1551#(<= main_~x~0 0)} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:31,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:31,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1553#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:31,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1553#(<= 48 main_~y~0)} assume ~y~0 < 0; {1546#false} is VALID [2022-04-15 06:13:31,713 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-15 06:13:31,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-15 06:13:31,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-15 06:13:31,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-15 06:13:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:31,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:32,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-15 06:13:32,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-15 06:13:32,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-15 06:13:32,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-15 06:13:32,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {1616#(not (< main_~y~0 0))} assume ~y~0 < 0; {1546#false} is VALID [2022-04-15 06:13:32,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1616#(not (< main_~y~0 0))} is VALID [2022-04-15 06:13:32,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:32,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:32,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:32,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {1634#(<= main_~x~0 48)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:32,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1634#(<= main_~x~0 48)} is VALID [2022-04-15 06:13:32,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-15 06:13:32,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-15 06:13:32,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-15 06:13:32,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-15 06:13:32,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2022-04-15 06:13:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:32,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124291279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:32,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:32,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-15 06:13:32,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888405707] [2022-04-15 06:13:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888405707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:13:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574196188] [2022-04-15 06:13:32,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:13:32,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:32,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:32,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:13:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:32,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:13:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:13:32,311 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:32,677 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 06:13:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:13:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:13:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:13:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:13:32,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 06:13:32,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:32,716 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:13:32,716 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:13:32,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:13:32,717 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:32,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:13:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:13:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 06:13:32,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:32,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,770 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,771 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:32,772 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 06:13:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 06:13:32,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:32,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:32,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:13:32,773 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:13:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:32,774 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 06:13:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 06:13:32,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:32,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:32,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:32,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 06:13:32,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2022-04-15 06:13:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:32,776 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 06:13:32,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:32,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 06:13:32,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 06:13:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:13:32,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:32,815 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:32,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:33,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:33,020 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -266410201, now seen corresponding path program 6 times [2022-04-15 06:13:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:33,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360088040] [2022-04-15 06:13:37,168 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:37,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:37,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:37,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash -974201397, now seen corresponding path program 1 times [2022-04-15 06:13:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:37,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930665251] [2022-04-15 06:13:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:37,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-15 06:13:37,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-15 06:13:37,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-15 06:13:37,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:37,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-15 06:13:37,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-15 06:13:37,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-15 06:13:37,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-15 06:13:37,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:37,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:37,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:37,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:37,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:37,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1923#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:37,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {1923#(<= 0 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-15 06:13:37,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-15 06:13:37,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-15 06:13:37,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-15 06:13:37,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-15 06:13:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930665251] [2022-04-15 06:13:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930665251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580485791] [2022-04-15 06:13:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:37,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:37,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:37,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:13:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:37,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:37,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:37,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1916#true} is VALID [2022-04-15 06:13:37,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-15 06:13:37,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-15 06:13:37,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-15 06:13:37,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-15 06:13:37,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1943#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:37,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#(<= main_~x~0 0)} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1943#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:37,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#(<= main_~x~0 0)} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1943#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:37,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#(<= main_~x~0 0)} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:37,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:37,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1960#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:37,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1960#(<= 48 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-15 06:13:37,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-15 06:13:37,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-15 06:13:37,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-15 06:13:37,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-15 06:13:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:37,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:38,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-15 06:13:38,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-15 06:13:38,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-15 06:13:38,442 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-15 06:13:38,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {1923#(<= 0 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-15 06:13:38,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1923#(<= 0 main_~y~0)} is VALID [2022-04-15 06:13:38,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:38,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:38,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:38,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {2005#(<= main_~x~0 48)} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:38,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2005#(<= main_~x~0 48)} is VALID [2022-04-15 06:13:38,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-15 06:13:38,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-15 06:13:38,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-15 06:13:38,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-15 06:13:38,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1916#true} is VALID [2022-04-15 06:13:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:38,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580485791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:38,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:38,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:13:38,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:38,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360088040] [2022-04-15 06:13:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360088040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:38,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:38,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:13:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379877403] [2022-04-15 06:13:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:13:38,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:38,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:38,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:38,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:13:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:13:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:13:38,649 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:39,114 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 06:13:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:13:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:13:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-15 06:13:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-15 06:13:39,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-15 06:13:39,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:39,160 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:13:39,160 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:13:39,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:13:39,161 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:39,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:13:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:13:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:13:39,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:39,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,220 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,220 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:39,222 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 06:13:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 06:13:39,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:39,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:39,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:13:39,222 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:13:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:39,223 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 06:13:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 06:13:39,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:39,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:39,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:39,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-15 06:13:39,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2022-04-15 06:13:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:39,225 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-15 06:13:39,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:39,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-15 06:13:39,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 06:13:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:13:39,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:39,270 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:39,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:39,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:39,496 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1235400189, now seen corresponding path program 7 times [2022-04-15 06:13:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583360598] [2022-04-15 06:13:39,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:40,069 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:40,070 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1531182795, now seen corresponding path program 1 times [2022-04-15 06:13:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:40,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874491109] [2022-04-15 06:13:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-15 06:13:40,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-15 06:13:40,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-15 06:13:40,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:40,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-15 06:13:40,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-15 06:13:40,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-15 06:13:40,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-15 06:13:40,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2319#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:40,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:40,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:40,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:40,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:40,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2322#(<= 49 main_~y~0)} is VALID [2022-04-15 06:13:40,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {2322#(<= 49 main_~y~0)} assume ~y~0 < 0; {2315#false} is VALID [2022-04-15 06:13:40,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-15 06:13:40,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-15 06:13:40,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-15 06:13:40,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-15 06:13:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874491109] [2022-04-15 06:13:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874491109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637659947] [2022-04-15 06:13:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:40,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:13:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:13:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:40,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:40,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2022-04-15 06:13:40,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-15 06:13:40,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-15 06:13:40,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-15 06:13:40,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-15 06:13:40,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2342#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:40,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {2342#(<= main_~x~0 0)} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2342#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:40,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(<= main_~x~0 0)} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2342#(<= main_~x~0 0)} is VALID [2022-04-15 06:13:40,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(<= main_~x~0 0)} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:40,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:13:40,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2359#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:40,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= 48 main_~y~0)} assume ~y~0 < 0; {2315#false} is VALID [2022-04-15 06:13:40,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-15 06:13:40,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-15 06:13:40,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-15 06:13:40,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-15 06:13:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:40,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:40,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-15 06:13:40,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-15 06:13:40,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-15 06:13:40,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-15 06:13:40,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2387#(not (< main_~y~0 0))} assume ~y~0 < 0; {2315#false} is VALID [2022-04-15 06:13:40,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2387#(not (< main_~y~0 0))} is VALID [2022-04-15 06:13:40,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:40,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:40,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:40,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2405#(<= main_~x~0 48)} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:40,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2405#(<= main_~x~0 48)} is VALID [2022-04-15 06:13:40,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-15 06:13:40,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-15 06:13:40,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-15 06:13:40,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-15 06:13:40,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2022-04-15 06:13:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637659947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:40,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:40,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:13:41,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583360598] [2022-04-15 06:13:41,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583360598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:41,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:41,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:13:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347752360] [2022-04-15 06:13:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:13:41,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:41,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:41,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:13:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:13:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:13:41,095 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:41,723 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-15 06:13:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:13:41,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:13:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-15 06:13:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-15 06:13:41,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 43 transitions. [2022-04-15 06:13:41,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:41,782 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:13:41,782 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:13:41,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:13:41,784 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:41,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 35 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:13:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:13:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-15 06:13:41,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:41,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,863 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,864 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:41,866 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 06:13:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 06:13:41,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:41,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:41,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:13:41,870 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:13:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:41,872 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 06:13:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 06:13:41,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:41,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:41,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:41,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-15 06:13:41,873 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2022-04-15 06:13:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:41,874 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-15 06:13:41,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:41,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-15 06:13:41,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 06:13:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:13:41,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:41,920 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:41,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:42,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:42,140 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1940936281, now seen corresponding path program 8 times [2022-04-15 06:13:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831554391] [2022-04-15 06:13:42,407 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:46,564 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:46,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:46,785 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -258400309, now seen corresponding path program 1 times [2022-04-15 06:13:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466469475] [2022-04-15 06:13:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:46,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-15 06:13:46,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-15 06:13:46,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-15 06:13:46,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:46,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-15 06:13:46,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-15 06:13:46,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-15 06:13:46,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-15 06:13:46,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2745#(= main_~x~0 0)} is VALID [2022-04-15 06:13:46,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#(= main_~x~0 0)} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2745#(= main_~x~0 0)} is VALID [2022-04-15 06:13:46,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#(= main_~x~0 0)} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2745#(= main_~x~0 0)} is VALID [2022-04-15 06:13:46,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(= main_~x~0 0)} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:46,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:46,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2747#(<= 48 main_~y~0)} is VALID [2022-04-15 06:13:46,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(<= 48 main_~y~0)} assume ~y~0 < 0; {2741#false} is VALID [2022-04-15 06:13:46,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-15 06:13:46,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-15 06:13:46,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-15 06:13:46,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-15 06:13:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466469475] [2022-04-15 06:13:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466469475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409158017] [2022-04-15 06:13:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:46,942 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:46,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 06:13:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:47,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:13:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:47,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:47,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-15 06:13:47,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-15 06:13:47,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-15 06:13:47,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-15 06:13:47,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-15 06:13:47,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:47,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:47,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:47,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:13:47,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:13:47,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2784#(<= 49 main_~y~0)} is VALID [2022-04-15 06:13:47,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {2784#(<= 49 main_~y~0)} assume ~y~0 < 0; {2741#false} is VALID [2022-04-15 06:13:47,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-15 06:13:47,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-15 06:13:47,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-15 06:13:47,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-15 06:13:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:47,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:47,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-15 06:13:47,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-15 06:13:47,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-15 06:13:47,961 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-15 06:13:47,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {2812#(not (< main_~y~0 0))} assume ~y~0 < 0; {2741#false} is VALID [2022-04-15 06:13:47,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2812#(not (< main_~y~0 0))} is VALID [2022-04-15 06:13:47,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:47,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:47,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:47,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {2830#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:47,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2830#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:13:47,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-15 06:13:47,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-15 06:13:47,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-15 06:13:47,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-15 06:13:47,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-15 06:13:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:47,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409158017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:47,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:47,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:13:48,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831554391] [2022-04-15 06:13:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831554391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:48,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:13:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975511355] [2022-04-15 06:13:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:13:48,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:48,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:48,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:48,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:13:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:13:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:13:48,293 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:49,020 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-15 06:13:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:13:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:13:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-04-15 06:13:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-04-15 06:13:49,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2022-04-15 06:13:49,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:49,075 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:13:49,075 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:13:49,076 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:13:49,076 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:49,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:13:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:13:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-15 06:13:49,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:49,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,207 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,207 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:49,208 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 06:13:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 06:13:49,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:49,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:49,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:13:49,211 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:13:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:49,212 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 06:13:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 06:13:49,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:49,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:49,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:49,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 06:13:49,213 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-04-15 06:13:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:49,214 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 06:13:49,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:49,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 06:13:49,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 06:13:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:13:49,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:49,269 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:49,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:49,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:49,470 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash -996706429, now seen corresponding path program 9 times [2022-04-15 06:13:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:49,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579726639] [2022-04-15 06:13:53,630 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:53,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:54,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:13:54,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2047983413, now seen corresponding path program 1 times [2022-04-15 06:13:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:54,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835013853] [2022-04-15 06:13:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:13:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:54,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-15 06:13:54,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 06:13:54,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-15 06:13:54,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:13:54,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-15 06:13:54,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 06:13:54,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-15 06:13:54,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-15 06:13:54,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:54,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:54,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:13:54,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:54,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:54,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3191#(<= 49 main_~y~0)} is VALID [2022-04-15 06:13:54,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 49 main_~y~0)} assume ~y~0 < 0; {3185#false} is VALID [2022-04-15 06:13:54,197 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-15 06:13:54,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-15 06:13:54,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-15 06:13:54,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-15 06:13:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:54,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835013853] [2022-04-15 06:13:54,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835013853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:13:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169614336] [2022-04-15 06:13:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:54,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:54,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:13:54,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 06:13:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:54,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:13:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:54,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:54,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-15 06:13:54,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-15 06:13:54,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 06:13:54,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-15 06:13:54,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-15 06:13:54,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:54,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:54,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:13:54,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:13:54,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:13:54,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3191#(<= 49 main_~y~0)} is VALID [2022-04-15 06:13:54,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 49 main_~y~0)} assume ~y~0 < 0; {3185#false} is VALID [2022-04-15 06:13:54,614 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-15 06:13:54,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-15 06:13:54,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-15 06:13:54,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-15 06:13:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:13:54,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:13:55,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-15 06:13:55,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-15 06:13:55,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-15 06:13:55,159 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-15 06:13:55,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(not (< main_~y~0 0))} assume ~y~0 < 0; {3185#false} is VALID [2022-04-15 06:13:55,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3255#(not (< main_~y~0 0))} is VALID [2022-04-15 06:13:55,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:55,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:13:55,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:55,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {3273#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:13:55,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3273#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:13:55,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-15 06:13:55,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-15 06:13:55,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 06:13:55,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-15 06:13:55,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-15 06:13:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:13:55,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169614336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:13:55,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:13:55,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:13:55,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:55,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579726639] [2022-04-15 06:13:55,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579726639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:55,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:55,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:13:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520902044] [2022-04-15 06:13:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:13:55,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:55,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:55,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:55,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:13:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:13:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:13:55,516 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:56,661 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-15 06:13:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:13:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:13:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-15 06:13:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-15 06:13:56,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 49 transitions. [2022-04-15 06:13:56,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:56,792 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:13:56,792 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 06:13:56,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:13:56,793 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:56,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:13:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 06:13:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 06:13:56,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:56,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,893 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,893 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:56,898 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 06:13:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 06:13:56,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:56,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:56,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:13:56,899 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:13:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:56,904 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 06:13:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 06:13:56,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:56,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:56,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:56,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-15 06:13:56,917 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2022-04-15 06:13:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:56,917 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-15 06:13:56,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:56,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-15 06:13:56,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 06:13:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:13:56,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:56,989 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:57,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:57,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 06:13:57,190 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 813992999, now seen corresponding path program 10 times [2022-04-15 06:13:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:57,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2115737807] [2022-04-15 06:13:57,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:00,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:00,415 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash 457400779, now seen corresponding path program 1 times [2022-04-15 06:14:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:00,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125149608] [2022-04-15 06:14:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:00,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:00,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-15 06:14:00,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-15 06:14:00,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-15 06:14:00,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:00,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-15 06:14:00,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-15 06:14:00,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-15 06:14:00,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-15 06:14:00,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3661#(= main_~x~0 0)} is VALID [2022-04-15 06:14:00,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(= main_~x~0 0)} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3661#(= main_~x~0 0)} is VALID [2022-04-15 06:14:00,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#(= main_~x~0 0)} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3661#(= main_~x~0 0)} is VALID [2022-04-15 06:14:00,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(= main_~x~0 0)} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:00,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:00,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3663#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-15 06:14:00,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {3663#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {3657#false} is VALID [2022-04-15 06:14:00,535 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-15 06:14:00,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-15 06:14:00,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-15 06:14:00,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-15 06:14:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125149608] [2022-04-15 06:14:00,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125149608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183334577] [2022-04-15 06:14:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:00,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:00,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:00,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:14:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:00,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:00,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:00,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2022-04-15 06:14:00,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-15 06:14:00,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-15 06:14:00,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-15 06:14:00,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-15 06:14:00,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:00,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:00,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:00,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:00,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:00,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3700#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:00,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {3700#(<= 49 main_~y~0)} assume ~y~0 < 0; {3657#false} is VALID [2022-04-15 06:14:00,964 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-15 06:14:00,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-15 06:14:00,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-15 06:14:00,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-15 06:14:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:00,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:01,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-15 06:14:01,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-15 06:14:01,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-15 06:14:01,563 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-15 06:14:01,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {3728#(not (< main_~y~0 0))} assume ~y~0 < 0; {3657#false} is VALID [2022-04-15 06:14:01,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3728#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:01,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:01,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:01,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:01,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {3746#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:01,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3746#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:01,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-15 06:14:01,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-15 06:14:01,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-15 06:14:01,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-15 06:14:01,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2022-04-15 06:14:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:01,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183334577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:01,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:01,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:01,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:01,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2115737807] [2022-04-15 06:14:01,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2115737807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:01,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:01,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:14:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965536733] [2022-04-15 06:14:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:14:01,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:01,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:01,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:01,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:14:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:14:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:14:01,966 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:03,029 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-15 06:14:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:14:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:14:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 06:14:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 06:14:03,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-15 06:14:03,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:03,081 INFO L225 Difference]: With dead ends: 66 [2022-04-15 06:14:03,081 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:14:03,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:14:03,082 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:03,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 88 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:14:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:14:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 06:14:03,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:03,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,226 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,226 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:03,227 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 06:14:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 06:14:03,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:03,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:03,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:14:03,228 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:14:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:03,233 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 06:14:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 06:14:03,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:03,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:03,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:03,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 06:14:03,241 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2022-04-15 06:14:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:03,242 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 06:14:03,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:03,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 06:14:03,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 06:14:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:14:03,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:03,302 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:03,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:03,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:14:03,504 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1428585213, now seen corresponding path program 11 times [2022-04-15 06:14:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624009231] [2022-04-15 06:14:03,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:04,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:04,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1332182325, now seen corresponding path program 1 times [2022-04-15 06:14:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:04,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746872006] [2022-04-15 06:14:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:04,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:04,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-15 06:14:04,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:14:04,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-15 06:14:04,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:04,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-15 06:14:04,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:14:04,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-15 06:14:04,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-15 06:14:04,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4153#(= main_~x~0 0)} is VALID [2022-04-15 06:14:04,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {4153#(= main_~x~0 0)} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4153#(= main_~x~0 0)} is VALID [2022-04-15 06:14:04,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(= main_~x~0 0)} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4153#(= main_~x~0 0)} is VALID [2022-04-15 06:14:04,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(= main_~x~0 0)} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:04,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:04,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4155#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:04,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {4155#(<= 48 main_~y~0)} assume ~y~0 < 0; {4149#false} is VALID [2022-04-15 06:14:04,211 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 06:14:04,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 06:14:04,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 06:14:04,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 06:14:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:04,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746872006] [2022-04-15 06:14:04,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746872006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:04,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925261420] [2022-04-15 06:14:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:04,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:14:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:04,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:04,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:04,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 06:14:04,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-15 06:14:04,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:14:04,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-15 06:14:04,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-15 06:14:04,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:04,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:04,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:04,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:04,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:04,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4192#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:04,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {4192#(<= 49 main_~y~0)} assume ~y~0 < 0; {4149#false} is VALID [2022-04-15 06:14:04,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 06:14:04,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 06:14:04,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 06:14:04,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 06:14:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:04,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:05,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 06:14:05,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 06:14:05,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 06:14:05,062 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 06:14:05,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(not (< main_~y~0 0))} assume ~y~0 < 0; {4149#false} is VALID [2022-04-15 06:14:05,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4220#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:05,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:05,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:05,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:05,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {4238#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:05,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4238#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:05,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-15 06:14:05,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-15 06:14:05,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 06:14:05,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-15 06:14:05,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 06:14:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:05,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925261420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:05,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:05,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:05,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624009231] [2022-04-15 06:14:05,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624009231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:05,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:05,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:14:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865691668] [2022-04-15 06:14:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:05,488 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:14:05,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:05,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:05,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:05,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:14:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:14:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:14:05,523 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,691 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-15 06:14:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:14:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:14:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2022-04-15 06:14:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2022-04-15 06:14:06,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 55 transitions. [2022-04-15 06:14:06,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:06,752 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:14:06,753 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:14:06,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:14:06,754 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:06,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 49 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:14:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:14:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 06:14:06,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:06,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,870 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,870 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,885 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 06:14:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 06:14:06,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:06,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:06,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 06:14:06,886 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 06:14:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,887 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 06:14:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 06:14:06,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:06,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:06,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:06,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-15 06:14:06,889 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2022-04-15 06:14:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:06,889 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-15 06:14:06,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:06,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2022-04-15 06:14:06,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 06:14:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:14:06,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:06,955 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:06,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:07,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:14:07,156 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1859809625, now seen corresponding path program 12 times [2022-04-15 06:14:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298827734] [2022-04-15 06:14:11,346 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:11,481 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:11,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:11,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1173201867, now seen corresponding path program 1 times [2022-04-15 06:14:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062398204] [2022-04-15 06:14:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:12,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-15 06:14:12,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-15 06:14:12,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-15 06:14:12,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:12,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-15 06:14:12,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-15 06:14:12,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-15 06:14:12,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-15 06:14:12,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:12,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:12,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:12,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:14:12,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:14:12,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4671#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:12,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {4671#(<= 49 main_~y~0)} assume ~y~0 < 0; {4665#false} is VALID [2022-04-15 06:14:12,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-15 06:14:12,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-15 06:14:12,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-15 06:14:12,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-15 06:14:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062398204] [2022-04-15 06:14:12,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062398204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529125414] [2022-04-15 06:14:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:12,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:12,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:14:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:14:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:12,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:12,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4664#true} is VALID [2022-04-15 06:14:12,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-15 06:14:12,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-15 06:14:12,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-15 06:14:12,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-15 06:14:12,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4691#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:12,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {4691#(<= main_~x~0 0)} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4691#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:12,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#(<= main_~x~0 0)} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4691#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:12,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#(<= main_~x~0 0)} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:14:12,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:14:12,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4708#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:12,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {4708#(<= 48 main_~y~0)} assume ~y~0 < 0; {4665#false} is VALID [2022-04-15 06:14:12,310 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-15 06:14:12,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-15 06:14:12,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-15 06:14:12,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-15 06:14:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:12,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:12,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-15 06:14:12,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-15 06:14:12,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-15 06:14:12,694 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-15 06:14:12,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {4736#(not (< main_~y~0 0))} assume ~y~0 < 0; {4665#false} is VALID [2022-04-15 06:14:12,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4736#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:12,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:12,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:12,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:12,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#(<= main_~x~0 48)} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:12,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4754#(<= main_~x~0 48)} is VALID [2022-04-15 06:14:12,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-15 06:14:12,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-15 06:14:12,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-15 06:14:12,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-15 06:14:12,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4664#true} is VALID [2022-04-15 06:14:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529125414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:12,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:13,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298827734] [2022-04-15 06:14:13,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298827734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:13,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:14:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964311057] [2022-04-15 06:14:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:13,223 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 06:14:13,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:13,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:13,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:13,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:14:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:14:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:14:13,261 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:15,029 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-15 06:14:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:14:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 06:14:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2022-04-15 06:14:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2022-04-15 06:14:15,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 58 transitions. [2022-04-15 06:14:15,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:15,087 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:14:15,087 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:14:15,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=448, Invalid=2522, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:14:15,088 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:15,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 85 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:14:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:14:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-15 06:14:15,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:15,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,211 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,211 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:15,213 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:14:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:14:15,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:15,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:15,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:14:15,214 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:14:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:15,215 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:14:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:14:15,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:15,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:15,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:15,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 06:14:15,217 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2022-04-15 06:14:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:15,217 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 06:14:15,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:15,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 06:14:15,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 06:14:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:14:15,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:15,287 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:15,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:15,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:14:15,488 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2075882115, now seen corresponding path program 13 times [2022-04-15 06:14:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:15,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680822755] [2022-04-15 06:14:19,647 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:19,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:24,013 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:24,179 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:24,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -616381237, now seen corresponding path program 1 times [2022-04-15 06:14:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811779220] [2022-04-15 06:14:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:24,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-15 06:14:24,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-15 06:14:24,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-15 06:14:24,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:24,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-15 06:14:24,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-15 06:14:24,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-15 06:14:24,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-15 06:14:24,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5214#(= main_~x~0 0)} is VALID [2022-04-15 06:14:24,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {5214#(= main_~x~0 0)} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5214#(= main_~x~0 0)} is VALID [2022-04-15 06:14:24,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {5214#(= main_~x~0 0)} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5214#(= main_~x~0 0)} is VALID [2022-04-15 06:14:24,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {5214#(= main_~x~0 0)} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:24,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:24,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5216#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:24,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {5216#(<= 48 main_~y~0)} assume ~y~0 < 0; {5210#false} is VALID [2022-04-15 06:14:24,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-15 06:14:24,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-15 06:14:24,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-15 06:14:24,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-15 06:14:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811779220] [2022-04-15 06:14:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811779220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024170817] [2022-04-15 06:14:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:24,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:24,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:24,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:14:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:24,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:24,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:24,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5209#true} is VALID [2022-04-15 06:14:24,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-15 06:14:24,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-15 06:14:24,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-15 06:14:24,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-15 06:14:24,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:24,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:24,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:24,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:24,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:24,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5253#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:24,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {5253#(<= 49 main_~y~0)} assume ~y~0 < 0; {5210#false} is VALID [2022-04-15 06:14:24,740 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-15 06:14:24,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-15 06:14:24,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-15 06:14:24,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-15 06:14:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:24,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:25,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-15 06:14:25,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-15 06:14:25,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-15 06:14:25,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-15 06:14:25,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {5281#(not (< main_~y~0 0))} assume ~y~0 < 0; {5210#false} is VALID [2022-04-15 06:14:25,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5281#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:25,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:25,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:25,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:25,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:25,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5299#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:25,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-15 06:14:25,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-15 06:14:25,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-15 06:14:25,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-15 06:14:25,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5209#true} is VALID [2022-04-15 06:14:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:25,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024170817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:25,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:25,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:25,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680822755] [2022-04-15 06:14:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680822755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:14:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861688506] [2022-04-15 06:14:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:25,796 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:14:25,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:25,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:25,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:25,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:14:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:14:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:14:25,836 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:27,794 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-15 06:14:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:14:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:14:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-15 06:14:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-15 06:14:27,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 61 transitions. [2022-04-15 06:14:27,851 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-15 06:14:27,852 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:14:27,852 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:14:27,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=443, Invalid=2637, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:14:27,854 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:27,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 86 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:14:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:14:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 06:14:27,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:27,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,991 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,991 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:27,992 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 06:14:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 06:14:27,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:27,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:27,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 06:14:27,993 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 06:14:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:27,994 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 06:14:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 06:14:27,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:27,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:27,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:27,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-15 06:14:27,997 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 49 [2022-04-15 06:14:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:27,997 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-15 06:14:27,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:27,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-15 06:14:28,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 06:14:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 06:14:28,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:28,072 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:28,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:28,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:14:28,272 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1956294951, now seen corresponding path program 14 times [2022-04-15 06:14:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:28,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491954509] [2022-04-15 06:14:28,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:28,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:28,867 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1889002955, now seen corresponding path program 1 times [2022-04-15 06:14:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:28,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713485284] [2022-04-15 06:14:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:29,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-15 06:14:29,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-15 06:14:29,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-15 06:14:29,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:29,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-15 06:14:29,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-15 06:14:29,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-15 06:14:29,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-15 06:14:29,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5778#(= main_~x~0 0)} is VALID [2022-04-15 06:14:29,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {5778#(= main_~x~0 0)} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5778#(= main_~x~0 0)} is VALID [2022-04-15 06:14:29,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {5778#(= main_~x~0 0)} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5778#(= main_~x~0 0)} is VALID [2022-04-15 06:14:29,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {5778#(= main_~x~0 0)} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:29,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:29,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5780#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:29,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {5780#(<= 48 main_~y~0)} assume ~y~0 < 0; {5774#false} is VALID [2022-04-15 06:14:29,036 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-15 06:14:29,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-15 06:14:29,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-15 06:14:29,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-15 06:14:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713485284] [2022-04-15 06:14:29,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713485284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891759154] [2022-04-15 06:14:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:29,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:29,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:29,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:14:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:29,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:14:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:29,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:29,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2022-04-15 06:14:29,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-15 06:14:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-15 06:14:29,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-15 06:14:29,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-15 06:14:29,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:29,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:29,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:29,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:14:29,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:14:29,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5817#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:29,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {5817#(<= 49 main_~y~0)} assume ~y~0 < 0; {5774#false} is VALID [2022-04-15 06:14:29,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-15 06:14:29,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-15 06:14:29,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-15 06:14:29,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-15 06:14:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:29,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:30,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-15 06:14:30,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-15 06:14:30,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-15 06:14:30,075 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-15 06:14:30,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {5845#(not (< main_~y~0 0))} assume ~y~0 < 0; {5774#false} is VALID [2022-04-15 06:14:30,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5845#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:30,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:30,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:30,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:30,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {5863#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:30,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5863#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:30,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-15 06:14:30,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-15 06:14:30,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-15 06:14:30,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-15 06:14:30,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2022-04-15 06:14:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891759154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:30,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:30,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491954509] [2022-04-15 06:14:30,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491954509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:30,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:30,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:14:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703214411] [2022-04-15 06:14:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 06:14:30,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:30,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:30,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:30,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:14:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:14:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:14:30,766 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:33,053 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-04-15 06:14:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:14:33,053 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 06:14:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 64 transitions. [2022-04-15 06:14:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 64 transitions. [2022-04-15 06:14:33,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 64 transitions. [2022-04-15 06:14:33,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:33,125 INFO L225 Difference]: With dead ends: 78 [2022-04-15 06:14:33,125 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:14:33,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:14:33,126 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:33,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:14:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:14:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 06:14:33,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:33,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,273 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,273 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:33,274 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:14:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:14:33,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:33,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:33,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:14:33,275 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:14:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:33,276 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:14:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:14:33,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:33,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:33,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:33,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-15 06:14:33,278 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 52 [2022-04-15 06:14:33,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:33,278 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-15 06:14:33,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:33,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-15 06:14:33,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 06:14:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:14:33,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:33,377 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:33,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:33,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 06:14:33,578 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -137019389, now seen corresponding path program 15 times [2022-04-15 06:14:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:33,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878940174] [2022-04-15 06:14:33,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:34,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:34,179 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash 99419851, now seen corresponding path program 1 times [2022-04-15 06:14:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:34,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972901933] [2022-04-15 06:14:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:34,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-15 06:14:34,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-15 06:14:34,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-15 06:14:34,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:34,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-15 06:14:34,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-15 06:14:34,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-15 06:14:34,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-15 06:14:34,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6366#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:14:34,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {6366#(and (= main_~x~0 0) (= main_~y~0 0))} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:34,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:34,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:14:34,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:14:34,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6369#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:34,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {6369#(<= 49 main_~y~0)} assume ~y~0 < 0; {6362#false} is VALID [2022-04-15 06:14:34,297 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-15 06:14:34,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-15 06:14:34,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-15 06:14:34,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-15 06:14:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972901933] [2022-04-15 06:14:34,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972901933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860954938] [2022-04-15 06:14:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:34,300 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:34,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:14:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:34,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:14:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:34,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:34,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6361#true} is VALID [2022-04-15 06:14:34,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-15 06:14:34,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-15 06:14:34,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-15 06:14:34,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-15 06:14:34,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6389#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:34,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {6389#(<= main_~x~0 0)} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6389#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:34,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {6389#(<= main_~x~0 0)} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6389#(<= main_~x~0 0)} is VALID [2022-04-15 06:14:34,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {6389#(<= main_~x~0 0)} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:14:34,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:14:34,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6406#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:34,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {6406#(<= 48 main_~y~0)} assume ~y~0 < 0; {6362#false} is VALID [2022-04-15 06:14:34,621 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-15 06:14:34,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-15 06:14:34,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-15 06:14:34,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-15 06:14:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:34,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:35,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-15 06:14:35,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-15 06:14:35,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-15 06:14:35,189 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-15 06:14:35,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {6434#(not (< main_~y~0 0))} assume ~y~0 < 0; {6362#false} is VALID [2022-04-15 06:14:35,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6434#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:35,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:35,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:35,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:35,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {6452#(<= main_~x~0 48)} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:35,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6452#(<= main_~x~0 48)} is VALID [2022-04-15 06:14:35,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-15 06:14:35,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-15 06:14:35,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-15 06:14:35,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-15 06:14:35,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6361#true} is VALID [2022-04-15 06:14:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:35,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860954938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:35,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:35,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:14:35,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:35,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878940174] [2022-04-15 06:14:35,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878940174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:35,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:14:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44502339] [2022-04-15 06:14:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:14:35,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:35,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:35,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:35,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:14:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:14:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1291, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:14:35,965 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:38,909 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-04-15 06:14:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:14:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:14:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. [2022-04-15 06:14:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. [2022-04-15 06:14:38,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 67 transitions. [2022-04-15 06:14:39,017 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-15 06:14:39,018 INFO L225 Difference]: With dead ends: 80 [2022-04-15 06:14:39,018 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:14:39,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=575, Invalid=3981, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:14:39,020 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:39,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:14:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:14:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 06:14:39,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:39,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:39,202 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:39,202 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:39,203 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-15 06:14:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-15 06:14:39,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:39,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:39,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:14:39,204 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:14:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:39,206 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-15 06:14:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-15 06:14:39,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:39,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:39,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:39,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-04-15 06:14:39,207 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 55 [2022-04-15 06:14:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:39,208 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-04-15 06:14:39,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:39,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 69 transitions. [2022-04-15 06:14:39,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-15 06:14:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 06:14:39,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:39,295 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:39,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:39,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:39,495 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 860615591, now seen corresponding path program 16 times [2022-04-15 06:14:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592427759] [2022-04-15 06:14:39,834 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:40,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:40,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1690163253, now seen corresponding path program 1 times [2022-04-15 06:14:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:40,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143789097] [2022-04-15 06:14:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:40,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-15 06:14:40,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-15 06:14:40,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-15 06:14:40,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:40,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-15 06:14:40,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-15 06:14:40,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-15 06:14:40,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-15 06:14:40,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6980#(= main_~x~0 0)} is VALID [2022-04-15 06:14:40,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {6980#(= main_~x~0 0)} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6980#(= main_~x~0 0)} is VALID [2022-04-15 06:14:40,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {6980#(= main_~x~0 0)} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6980#(= main_~x~0 0)} is VALID [2022-04-15 06:14:40,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#(= main_~x~0 0)} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:40,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:40,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6982#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:40,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {6982#(<= 48 main_~y~0)} assume ~y~0 < 0; {6976#false} is VALID [2022-04-15 06:14:40,195 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-15 06:14:40,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-15 06:14:40,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-15 06:14:40,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-15 06:14:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:40,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143789097] [2022-04-15 06:14:40,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143789097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:40,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961795216] [2022-04-15 06:14:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:40,197 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:40,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:14:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:40,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:40,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:40,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6975#true} is VALID [2022-04-15 06:14:40,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-15 06:14:40,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-15 06:14:40,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-15 06:14:40,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-15 06:14:40,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:40,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:40,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:40,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:40,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:40,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7019#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:40,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {7019#(<= 49 main_~y~0)} assume ~y~0 < 0; {6976#false} is VALID [2022-04-15 06:14:40,559 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-15 06:14:40,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-15 06:14:40,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-15 06:14:40,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-15 06:14:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:40,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:41,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-15 06:14:41,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-15 06:14:41,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-15 06:14:41,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-15 06:14:41,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {7047#(not (< main_~y~0 0))} assume ~y~0 < 0; {6976#false} is VALID [2022-04-15 06:14:41,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7047#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:41,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:41,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:41,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:41,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {7065#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:41,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7065#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:41,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-15 06:14:41,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-15 06:14:41,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-15 06:14:41,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-15 06:14:41,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6975#true} is VALID [2022-04-15 06:14:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961795216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:41,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:41,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:41,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592427759] [2022-04-15 06:14:41,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592427759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:41,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:41,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:14:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845489852] [2022-04-15 06:14:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:41,871 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 06:14:41,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:41,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:41,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:41,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:14:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:14:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:14:41,937 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:44,383 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-15 06:14:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:14:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 06:14:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-04-15 06:14:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-04-15 06:14:44,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 70 transitions. [2022-04-15 06:14:44,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:44,450 INFO L225 Difference]: With dead ends: 84 [2022-04-15 06:14:44,450 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:14:44,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=554, Invalid=4002, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:14:44,452 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:44,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 144 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:14:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:14:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 06:14:44,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:44,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,643 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,644 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:44,645 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:14:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:14:44,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:44,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:44,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:14:44,646 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:14:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:44,647 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:14:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:14:44,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:44,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:44,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:44,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 06:14:44,648 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 58 [2022-04-15 06:14:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:44,658 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 06:14:44,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:44,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 06:14:44,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:14:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:14:44,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:44,747 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:44,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:44,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:44,948 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 230616451, now seen corresponding path program 17 times [2022-04-15 06:14:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:44,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027088552] [2022-04-15 06:14:45,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:45,509 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:45,511 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 815220939, now seen corresponding path program 1 times [2022-04-15 06:14:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:45,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247581800] [2022-04-15 06:14:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:45,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-15 06:14:45,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-15 06:14:45,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-15 06:14:45,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:45,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-15 06:14:45,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-15 06:14:45,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-15 06:14:45,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-15 06:14:45,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7616#(= main_~x~0 0)} is VALID [2022-04-15 06:14:45,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {7616#(= main_~x~0 0)} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7616#(= main_~x~0 0)} is VALID [2022-04-15 06:14:45,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {7616#(= main_~x~0 0)} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7616#(= main_~x~0 0)} is VALID [2022-04-15 06:14:45,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {7616#(= main_~x~0 0)} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:45,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:45,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7618#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:45,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {7618#(<= 48 main_~y~0)} assume ~y~0 < 0; {7612#false} is VALID [2022-04-15 06:14:45,614 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-15 06:14:45,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-15 06:14:45,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-15 06:14:45,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-15 06:14:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:45,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247581800] [2022-04-15 06:14:45,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247581800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499334427] [2022-04-15 06:14:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:45,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:45,621 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:45,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:14:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:45,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:45,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:45,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2022-04-15 06:14:45,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-15 06:14:45,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-15 06:14:45,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-15 06:14:45,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-15 06:14:45,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:46,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:46,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:46,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:46,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:46,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7655#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:46,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {7655#(<= 49 main_~y~0)} assume ~y~0 < 0; {7612#false} is VALID [2022-04-15 06:14:46,003 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-15 06:14:46,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-15 06:14:46,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-15 06:14:46,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-15 06:14:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:46,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:46,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-15 06:14:46,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-15 06:14:46,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-15 06:14:46,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-15 06:14:46,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {7683#(not (< main_~y~0 0))} assume ~y~0 < 0; {7612#false} is VALID [2022-04-15 06:14:46,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7683#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:46,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:46,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:46,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:46,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {7701#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:46,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7701#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:46,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-15 06:14:46,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-15 06:14:46,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-15 06:14:46,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-15 06:14:46,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2022-04-15 06:14:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:46,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499334427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:46,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:46,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:47,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027088552] [2022-04-15 06:14:47,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027088552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:47,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:47,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:14:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145442395] [2022-04-15 06:14:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:14:47,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:47,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,447 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-15 06:14:47,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:14:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:14:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:14:47,449 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:50,236 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-15 06:14:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:14:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:14:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2022-04-15 06:14:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2022-04-15 06:14:50,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 73 transitions. [2022-04-15 06:14:50,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:50,343 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:14:50,343 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:14:50,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=591, Invalid=4521, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:14:50,345 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:50,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 125 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:14:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:14:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-15 06:14:50,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:50,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,577 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,577 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:50,578 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 06:14:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-15 06:14:50,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:50,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:50,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:14:50,579 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:14:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:50,580 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 06:14:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-15 06:14:50,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:50,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:50,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:50,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-15 06:14:50,596 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 61 [2022-04-15 06:14:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:50,597 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-15 06:14:50,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:50,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2022-04-15 06:14:50,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:14:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:14:50,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:50,690 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:50,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:50,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:50,891 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 933320231, now seen corresponding path program 18 times [2022-04-15 06:14:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:50,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203741748] [2022-04-15 06:14:51,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:51,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:51,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash -974362165, now seen corresponding path program 1 times [2022-04-15 06:14:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607276172] [2022-04-15 06:14:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-15 06:14:51,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-15 06:14:51,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-15 06:14:51,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:51,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-15 06:14:51,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-15 06:14:51,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-15 06:14:51,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-15 06:14:51,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8276#(= main_~x~0 0)} is VALID [2022-04-15 06:14:51,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {8276#(= main_~x~0 0)} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8276#(= main_~x~0 0)} is VALID [2022-04-15 06:14:51,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {8276#(= main_~x~0 0)} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8276#(= main_~x~0 0)} is VALID [2022-04-15 06:14:51,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {8276#(= main_~x~0 0)} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:51,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:51,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8278#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:51,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {8278#(<= 48 main_~y~0)} assume ~y~0 < 0; {8272#false} is VALID [2022-04-15 06:14:51,781 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-15 06:14:51,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-15 06:14:51,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-15 06:14:51,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-15 06:14:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607276172] [2022-04-15 06:14:51,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607276172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608180965] [2022-04-15 06:14:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:51,783 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:51,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:14:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:52,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2022-04-15 06:14:52,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-15 06:14:52,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-15 06:14:52,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-15 06:14:52,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-15 06:14:52,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:52,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:52,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:52,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:52,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:52,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8315#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:52,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {8315#(<= 49 main_~y~0)} assume ~y~0 < 0; {8272#false} is VALID [2022-04-15 06:14:52,152 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-15 06:14:52,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-15 06:14:52,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-15 06:14:52,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-15 06:14:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:52,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:52,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-15 06:14:52,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-15 06:14:52,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-15 06:14:52,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-15 06:14:52,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {8343#(not (< main_~y~0 0))} assume ~y~0 < 0; {8272#false} is VALID [2022-04-15 06:14:52,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8343#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:52,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:52,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:52,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:52,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {8361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:52,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:52,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-15 06:14:52,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-15 06:14:52,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-15 06:14:52,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-15 06:14:52,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2022-04-15 06:14:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:52,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608180965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:52,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:52,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:53,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203741748] [2022-04-15 06:14:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203741748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:53,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:53,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:14:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77288585] [2022-04-15 06:14:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 06:14:53,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:53,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:53,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:53,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:14:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:14:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:14:53,484 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,509 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-15 06:14:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:14:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 06:14:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2022-04-15 06:14:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2022-04-15 06:14:56,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 76 transitions. [2022-04-15 06:14:56,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:56,585 INFO L225 Difference]: With dead ends: 90 [2022-04-15 06:14:56,585 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:14:56,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=628, Invalid=5072, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:14:56,587 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:56,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 66 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:14:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:14:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-04-15 06:14:56,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:56,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,793 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,793 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,795 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-15 06:14:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-15 06:14:56,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:56,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:56,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:14:56,795 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:14:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,820 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-15 06:14:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-15 06:14:56,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:56,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:56,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:56,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-04-15 06:14:56,822 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 64 [2022-04-15 06:14:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:56,823 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-04-15 06:14:56,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:56,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2022-04-15 06:14:56,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-04-15 06:14:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:14:56,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:56,942 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:56,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:57,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:57,143 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1511029507, now seen corresponding path program 19 times [2022-04-15 06:14:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:57,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776323710] [2022-04-15 06:14:57,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:57,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:57,651 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1531022027, now seen corresponding path program 1 times [2022-04-15 06:14:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:57,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772408612] [2022-04-15 06:14:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:57,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-15 06:14:57,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 06:14:57,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-15 06:14:57,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:57,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-15 06:14:57,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 06:14:57,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-15 06:14:57,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-15 06:14:57,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8960#(= main_~x~0 0)} is VALID [2022-04-15 06:14:57,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {8960#(= main_~x~0 0)} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8960#(= main_~x~0 0)} is VALID [2022-04-15 06:14:57,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {8960#(= main_~x~0 0)} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8960#(= main_~x~0 0)} is VALID [2022-04-15 06:14:57,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {8960#(= main_~x~0 0)} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:57,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:14:57,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8962#(<= 48 main_~y~0)} is VALID [2022-04-15 06:14:57,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {8962#(<= 48 main_~y~0)} assume ~y~0 < 0; {8956#false} is VALID [2022-04-15 06:14:57,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-15 06:14:57,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 06:14:57,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 06:14:57,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 06:14:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:57,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772408612] [2022-04-15 06:14:57,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772408612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:57,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721408774] [2022-04-15 06:14:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:57,773 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:14:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:57,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:57,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:58,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-15 06:14:58,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-15 06:14:58,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 06:14:58,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-15 06:14:58,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-15 06:14:58,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:58,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:58,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:14:58,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:58,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:14:58,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8999#(<= 49 main_~y~0)} is VALID [2022-04-15 06:14:58,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {8999#(<= 49 main_~y~0)} assume ~y~0 < 0; {8956#false} is VALID [2022-04-15 06:14:58,136 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-15 06:14:58,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 06:14:58,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 06:14:58,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 06:14:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:14:58,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:58,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 06:14:58,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 06:14:58,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 06:14:58,576 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-15 06:14:58,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {9027#(not (< main_~y~0 0))} assume ~y~0 < 0; {8956#false} is VALID [2022-04-15 06:14:58,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9027#(not (< main_~y~0 0))} is VALID [2022-04-15 06:14:58,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:58,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:14:58,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:58,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {9045#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:14:58,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9045#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:14:58,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-15 06:14:58,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-15 06:14:58,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 06:14:58,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-15 06:14:58,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-15 06:14:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:58,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721408774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:58,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:58,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:14:59,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:59,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776323710] [2022-04-15 06:14:59,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776323710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:59,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:59,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:14:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60329588] [2022-04-15 06:14:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:14:59,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:59,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:59,544 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-15 06:14:59,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:14:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:59,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:14:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:14:59,545 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:02,870 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-15 06:15:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:15:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:15:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-15 06:15:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-15 06:15:02,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 79 transitions. [2022-04-15 06:15:02,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:02,944 INFO L225 Difference]: With dead ends: 93 [2022-04-15 06:15:02,944 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 06:15:02,946 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=665, Invalid=5655, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 06:15:02,946 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:02,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 62 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:15:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 06:15:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-15 06:15:03,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:03,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:03,176 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:03,176 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,183 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 06:15:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 06:15:03,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:03,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 06:15:03,188 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 06:15:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,189 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 06:15:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 06:15:03,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:03,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:03,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-04-15 06:15:03,191 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 67 [2022-04-15 06:15:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:03,192 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-04-15 06:15:03,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:03,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2022-04-15 06:15:03,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-15 06:15:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 06:15:03,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:03,308 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:03,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:03,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:03,509 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2114115751, now seen corresponding path program 20 times [2022-04-15 06:15:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:03,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63102425] [2022-04-15 06:15:03,823 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:04,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:04,101 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -258561077, now seen corresponding path program 1 times [2022-04-15 06:15:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006178354] [2022-04-15 06:15:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:04,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-15 06:15:04,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-15 06:15:04,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-15 06:15:04,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:04,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-15 06:15:04,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-15 06:15:04,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-15 06:15:04,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-15 06:15:04,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9668#(= main_~x~0 0)} is VALID [2022-04-15 06:15:04,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {9668#(= main_~x~0 0)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9669#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:04,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(<= main_~x~0 0)} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9669#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:04,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {9669#(<= main_~x~0 0)} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:04,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:04,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9671#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:04,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(<= 48 main_~y~0)} assume ~y~0 < 0; {9664#false} is VALID [2022-04-15 06:15:04,216 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-15 06:15:04,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-15 06:15:04,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-15 06:15:04,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-15 06:15:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006178354] [2022-04-15 06:15:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006178354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878785070] [2022-04-15 06:15:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:04,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:04,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:04,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:15:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:04,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:15:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:04,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:04,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9663#true} is VALID [2022-04-15 06:15:04,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-15 06:15:04,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-15 06:15:04,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-15 06:15:04,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-15 06:15:04,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9669#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:04,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(<= main_~x~0 0)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9669#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:04,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(<= main_~x~0 0)} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9669#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:04,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {9669#(<= main_~x~0 0)} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:04,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:04,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9671#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:04,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(<= 48 main_~y~0)} assume ~y~0 < 0; {9664#false} is VALID [2022-04-15 06:15:04,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-15 06:15:04,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-15 06:15:04,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-15 06:15:04,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-15 06:15:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:04,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:04,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-15 06:15:04,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-15 06:15:04,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-15 06:15:04,995 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-15 06:15:04,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {9734#(not (< main_~y~0 0))} assume ~y~0 < 0; {9664#false} is VALID [2022-04-15 06:15:04,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9734#(not (< main_~y~0 0))} is VALID [2022-04-15 06:15:04,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:04,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:05,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {9752#(<= main_~x~0 48)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:05,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9752#(<= main_~x~0 48)} is VALID [2022-04-15 06:15:05,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-15 06:15:05,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-15 06:15:05,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-15 06:15:05,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-15 06:15:05,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9663#true} is VALID [2022-04-15 06:15:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:05,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878785070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:05,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:05,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-15 06:15:06,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:06,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63102425] [2022-04-15 06:15:06,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63102425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:06,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:06,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:15:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989047040] [2022-04-15 06:15:06,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 06:15:06,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:06,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:06,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:06,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:15:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:15:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1822, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:15:06,091 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:09,617 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-15 06:15:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:15:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 06:15:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 82 transitions. [2022-04-15 06:15:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 82 transitions. [2022-04-15 06:15:09,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 82 transitions. [2022-04-15 06:15:09,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:09,730 INFO L225 Difference]: With dead ends: 96 [2022-04-15 06:15:09,730 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 06:15:09,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=734, Invalid=6072, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:15:09,731 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:09,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:15:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 06:15:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 06:15:09,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:09,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,979 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,980 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:09,982 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 06:15:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 06:15:09,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:09,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:09,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 06:15:09,982 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 06:15:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:09,984 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 06:15:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 06:15:09,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:09,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:09,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:09,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-15 06:15:09,985 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 70 [2022-04-15 06:15:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:09,986 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-15 06:15:09,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:09,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-15 06:15:10,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-15 06:15:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 06:15:10,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:10,098 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:10,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:10,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:10,299 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1486755709, now seen corresponding path program 21 times [2022-04-15 06:15:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:10,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825461964] [2022-04-15 06:15:10,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:10,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:10,905 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2048144181, now seen corresponding path program 1 times [2022-04-15 06:15:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:10,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501141473] [2022-04-15 06:15:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:11,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-15 06:15:11,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 06:15:11,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-15 06:15:11,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:11,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-15 06:15:11,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 06:15:11,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-15 06:15:11,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-15 06:15:11,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10399#(= main_~x~0 0)} is VALID [2022-04-15 06:15:11,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {10399#(= main_~x~0 0)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10400#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:11,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(<= main_~x~0 0)} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10400#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:11,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#(<= main_~x~0 0)} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:11,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:11,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10402#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:11,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {10402#(<= 48 main_~y~0)} assume ~y~0 < 0; {10395#false} is VALID [2022-04-15 06:15:11,024 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-15 06:15:11,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-15 06:15:11,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-15 06:15:11,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-15 06:15:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:11,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:11,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501141473] [2022-04-15 06:15:11,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501141473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:11,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6494804] [2022-04-15 06:15:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:11,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:11,028 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:15:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:11,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:15:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:11,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:11,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-15 06:15:11,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-15 06:15:11,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 06:15:11,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-15 06:15:11,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-15 06:15:11,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10400#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:11,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {10400#(<= main_~x~0 0)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10400#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:11,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(<= main_~x~0 0)} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10400#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:11,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#(<= main_~x~0 0)} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:11,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:11,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10402#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:11,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {10402#(<= 48 main_~y~0)} assume ~y~0 < 0; {10395#false} is VALID [2022-04-15 06:15:11,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-15 06:15:11,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-15 06:15:11,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-15 06:15:11,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-15 06:15:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:11,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:11,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-15 06:15:11,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-15 06:15:11,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-15 06:15:11,762 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-15 06:15:11,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {10465#(not (< main_~y~0 0))} assume ~y~0 < 0; {10395#false} is VALID [2022-04-15 06:15:11,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10465#(not (< main_~y~0 0))} is VALID [2022-04-15 06:15:11,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:11,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:11,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:11,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {10483#(<= main_~x~0 48)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:11,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10483#(<= main_~x~0 48)} is VALID [2022-04-15 06:15:11,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-15 06:15:11,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-15 06:15:11,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-15 06:15:11,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-15 06:15:11,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-15 06:15:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:11,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6494804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:11,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:11,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-15 06:15:12,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825461964] [2022-04-15 06:15:12,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825461964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:12,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:12,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:15:12,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657526317] [2022-04-15 06:15:12,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:15:12,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:12,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:12,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:12,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:15:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:15:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:15:12,704 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,592 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-04-15 06:15:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:15:16,592 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:15:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 85 transitions. [2022-04-15 06:15:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 85 transitions. [2022-04-15 06:15:16,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 85 transitions. [2022-04-15 06:15:16,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:16,682 INFO L225 Difference]: With dead ends: 99 [2022-04-15 06:15:16,682 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 06:15:16,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=773, Invalid=6709, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 06:15:16,684 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:16,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 94 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:15:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 06:15:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-15 06:15:16,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:16,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,940 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,941 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,942 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 06:15:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:15:16,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:16,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:16,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 06:15:16,943 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 06:15:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,955 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 06:15:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:15:16,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:16,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:16,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:16,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-04-15 06:15:16,957 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 73 [2022-04-15 06:15:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:16,957 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-04-15 06:15:16,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:16,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 87 transitions. [2022-04-15 06:15:17,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-15 06:15:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 06:15:17,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:17,143 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:17,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:17,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 06:15:17,343 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 349731623, now seen corresponding path program 22 times [2022-04-15 06:15:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:17,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891110172] [2022-04-15 06:15:21,516 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:21,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:21,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:21,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 457240011, now seen corresponding path program 1 times [2022-04-15 06:15:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:21,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316503336] [2022-04-15 06:15:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:21,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-15 06:15:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-15 06:15:21,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-15 06:15:21,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:21,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-15 06:15:21,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-15 06:15:21,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-15 06:15:21,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-15 06:15:21,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:21,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {11154#(and (= main_~x~0 0) (= main_~y~0 0))} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:21,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:21,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:21,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:21,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11157#(<= 49 main_~y~0)} is VALID [2022-04-15 06:15:21,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {11157#(<= 49 main_~y~0)} assume ~y~0 < 0; {11150#false} is VALID [2022-04-15 06:15:21,969 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-15 06:15:21,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-15 06:15:21,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-15 06:15:21,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-15 06:15:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:21,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316503336] [2022-04-15 06:15:21,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316503336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:21,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855434813] [2022-04-15 06:15:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:21,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:21,971 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:21,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:15:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:22,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:15:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:22,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:22,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11149#true} is VALID [2022-04-15 06:15:22,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-15 06:15:22,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-15 06:15:22,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-15 06:15:22,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-15 06:15:22,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11177#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:22,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {11177#(<= main_~x~0 0)} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11177#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:22,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {11177#(<= main_~x~0 0)} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11177#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:22,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {11177#(<= main_~x~0 0)} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:22,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:22,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11194#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:22,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {11194#(<= 48 main_~y~0)} assume ~y~0 < 0; {11150#false} is VALID [2022-04-15 06:15:22,201 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-15 06:15:22,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-15 06:15:22,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-15 06:15:22,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-15 06:15:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:22,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:22,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-15 06:15:22,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-15 06:15:22,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-15 06:15:22,562 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-15 06:15:22,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {11222#(not (< main_~y~0 0))} assume ~y~0 < 0; {11150#false} is VALID [2022-04-15 06:15:22,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11222#(not (< main_~y~0 0))} is VALID [2022-04-15 06:15:22,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:22,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:22,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:22,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#(<= main_~x~0 48)} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:22,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11240#(<= main_~x~0 48)} is VALID [2022-04-15 06:15:22,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-15 06:15:22,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-15 06:15:22,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-15 06:15:22,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-15 06:15:22,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11149#true} is VALID [2022-04-15 06:15:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:22,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855434813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:22,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:22,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:15:23,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:23,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891110172] [2022-04-15 06:15:23,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891110172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:23,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:23,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:15:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439838864] [2022-04-15 06:15:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:23,626 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 06:15:23,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:23,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:23,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:23,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:15:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:15:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:15:23,693 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:28,209 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-15 06:15:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:15:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 06:15:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 88 transitions. [2022-04-15 06:15:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 88 transitions. [2022-04-15 06:15:28,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 88 transitions. [2022-04-15 06:15:28,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:28,288 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:15:28,289 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 06:15:28,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=841, Invalid=8279, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:15:28,290 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:28,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 06:15:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 06:15:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-04-15 06:15:28,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:28,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,507 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,507 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:28,509 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-15 06:15:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-15 06:15:28,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:28,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:28,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 06:15:28,510 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 06:15:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:28,511 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-15 06:15:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-15 06:15:28,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:28,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:28,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:28,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-15 06:15:28,513 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 76 [2022-04-15 06:15:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:28,514 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-15 06:15:28,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:28,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-15 06:15:28,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 06:15:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 06:15:28,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:28,640 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:28,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 06:15:28,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 06:15:28,841 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1850422787, now seen corresponding path program 23 times [2022-04-15 06:15:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:28,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711786244] [2022-04-15 06:15:29,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:32,122 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:32,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:32,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1332343093, now seen corresponding path program 1 times [2022-04-15 06:15:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428623108] [2022-04-15 06:15:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:32,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-15 06:15:32,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-15 06:15:32,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-15 06:15:32,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:32,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-15 06:15:32,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-15 06:15:32,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-15 06:15:32,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-15 06:15:32,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:32,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:32,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:32,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:32,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:32,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11942#(<= 0 main_~y~0)} is VALID [2022-04-15 06:15:32,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {11942#(<= 0 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-15 06:15:32,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-15 06:15:32,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-15 06:15:32,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-15 06:15:32,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-15 06:15:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:32,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:32,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428623108] [2022-04-15 06:15:32,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428623108] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:32,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602952544] [2022-04-15 06:15:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:32,295 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:32,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:15:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:32,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:15:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:32,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:32,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11935#true} is VALID [2022-04-15 06:15:32,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-15 06:15:32,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-15 06:15:32,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-15 06:15:32,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-15 06:15:32,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:32,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:32,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:32,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:15:32,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:15:32,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11979#(<= 49 main_~y~0)} is VALID [2022-04-15 06:15:32,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {11979#(<= 49 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-15 06:15:32,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-15 06:15:32,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-15 06:15:32,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-15 06:15:32,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-15 06:15:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:32,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:33,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-15 06:15:33,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-15 06:15:33,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-15 06:15:33,033 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-15 06:15:33,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {11942#(<= 0 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-15 06:15:33,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11942#(<= 0 main_~y~0)} is VALID [2022-04-15 06:15:33,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:33,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:33,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:33,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {12024#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:33,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12024#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:15:33,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-15 06:15:33,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-15 06:15:33,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-15 06:15:33,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-15 06:15:33,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11935#true} is VALID [2022-04-15 06:15:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:33,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602952544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:33,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:33,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:15:34,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:34,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711786244] [2022-04-15 06:15:34,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711786244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:34,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:34,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:15:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811632384] [2022-04-15 06:15:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 06:15:34,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:34,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:34,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:34,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:15:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:15:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2478, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:15:34,223 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:39,302 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-04-15 06:15:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:15:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 06:15:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-15 06:15:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-15 06:15:39,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 91 transitions. [2022-04-15 06:15:39,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:39,396 INFO L225 Difference]: With dead ends: 104 [2022-04-15 06:15:39,396 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 06:15:39,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=914, Invalid=8788, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:15:39,398 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:39,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 185 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:15:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 06:15:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 06:15:39,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:39,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,686 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,686 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:39,688 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:15:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:15:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:39,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 06:15:39,689 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 06:15:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:39,690 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:15:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:15:39,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:39,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:39,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:39,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-04-15 06:15:39,692 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 79 [2022-04-15 06:15:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:39,692 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-04-15 06:15:39,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:39,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2022-04-15 06:15:39,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:15:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 06:15:39,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:39,813 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:39,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:40,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:15:40,014 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1668661849, now seen corresponding path program 24 times [2022-04-15 06:15:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:40,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983270590] [2022-04-15 06:15:40,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:43,828 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:43,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:43,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1173041099, now seen corresponding path program 1 times [2022-04-15 06:15:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:43,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871280670] [2022-04-15 06:15:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:43,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-15 06:15:43,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-15 06:15:43,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-15 06:15:43,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:43,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-15 06:15:43,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-15 06:15:43,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-15 06:15:43,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-15 06:15:43,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12746#(= main_~x~0 0)} is VALID [2022-04-15 06:15:43,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {12746#(= main_~x~0 0)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12746#(= main_~x~0 0)} is VALID [2022-04-15 06:15:43,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {12746#(= main_~x~0 0)} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12746#(= main_~x~0 0)} is VALID [2022-04-15 06:15:43,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {12746#(= main_~x~0 0)} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:43,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:15:43,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12748#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:43,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {12748#(<= 48 main_~y~0)} assume ~y~0 < 0; {12742#false} is VALID [2022-04-15 06:15:43,993 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-15 06:15:43,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-15 06:15:43,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-15 06:15:43,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-15 06:15:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871280670] [2022-04-15 06:15:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871280670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341148798] [2022-04-15 06:15:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:43,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:43,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:43,995 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:43,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:15:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:44,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:15:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:44,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:44,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12741#true} is VALID [2022-04-15 06:15:44,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-15 06:15:44,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-15 06:15:44,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-15 06:15:44,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-15 06:15:44,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12768#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:44,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {12768#(<= main_~x~0 0)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12768#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:44,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {12768#(<= main_~x~0 0)} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12768#(<= main_~x~0 0)} is VALID [2022-04-15 06:15:44,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {12768#(<= main_~x~0 0)} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:44,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:15:44,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12748#(<= 48 main_~y~0)} is VALID [2022-04-15 06:15:44,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {12748#(<= 48 main_~y~0)} assume ~y~0 < 0; {12742#false} is VALID [2022-04-15 06:15:44,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-15 06:15:44,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-15 06:15:44,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-15 06:15:44,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-15 06:15:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:44,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:44,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-15 06:15:44,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-15 06:15:44,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-15 06:15:44,505 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-15 06:15:44,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {12812#(not (< main_~y~0 0))} assume ~y~0 < 0; {12742#false} is VALID [2022-04-15 06:15:44,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12812#(not (< main_~y~0 0))} is VALID [2022-04-15 06:15:44,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:44,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:44,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:44,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {12830#(<= main_~x~0 48)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:44,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12830#(<= main_~x~0 48)} is VALID [2022-04-15 06:15:44,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-15 06:15:44,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-15 06:15:44,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-15 06:15:44,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-15 06:15:44,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12741#true} is VALID [2022-04-15 06:15:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:44,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341148798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:44,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:44,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:15:45,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:45,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983270590] [2022-04-15 06:15:45,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983270590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:45,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:45,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:15:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915755110] [2022-04-15 06:15:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 06:15:45,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:45,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:45,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:45,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:15:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:15:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:15:45,630 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:49,875 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-04-15 06:15:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:15:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 06:15:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 06:15:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-15 06:15:49,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 94 transitions. [2022-04-15 06:15:49,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:49,959 INFO L225 Difference]: With dead ends: 108 [2022-04-15 06:15:49,959 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 06:15:49,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=890, Invalid=8812, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:15:49,962 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:49,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 132 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:15:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 06:15:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-15 06:15:50,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:50,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:50,239 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:50,239 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:50,240 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-15 06:15:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-15 06:15:50,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:50,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:50,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 06:15:50,241 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 06:15:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:50,242 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-15 06:15:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-15 06:15:50,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:50,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:50,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:50,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-15 06:15:50,244 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 82 [2022-04-15 06:15:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:50,245 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-15 06:15:50,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:50,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-15 06:15:50,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 06:15:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 06:15:50,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:50,387 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:50,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:50,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:50,611 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1432642435, now seen corresponding path program 25 times [2022-04-15 06:15:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821667758] [2022-04-15 06:15:50,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:51,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:15:51,112 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -616542005, now seen corresponding path program 1 times [2022-04-15 06:15:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:51,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881166739] [2022-04-15 06:15:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:51,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-15 06:15:51,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-15 06:15:51,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13573#(= main_~x~0 0)} is VALID [2022-04-15 06:15:51,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {13573#(= main_~x~0 0)} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13573#(= main_~x~0 0)} is VALID [2022-04-15 06:15:51,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {13573#(= main_~x~0 0)} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13573#(= main_~x~0 0)} is VALID [2022-04-15 06:15:51,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {13573#(= main_~x~0 0)} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:15:51,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:15:51,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13575#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-15 06:15:51,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {13575#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {13569#false} is VALID [2022-04-15 06:15:51,181 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-15 06:15:51,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-15 06:15:51,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-15 06:15:51,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-15 06:15:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881166739] [2022-04-15 06:15:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881166739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:51,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978972049] [2022-04-15 06:15:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:51,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:51,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:51,183 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:51,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:15:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:15:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:51,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13568#true} is VALID [2022-04-15 06:15:51,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-15 06:15:51,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-15 06:15:51,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-15 06:15:51,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-15 06:15:51,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:51,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:51,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:15:51,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:15:51,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:15:51,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13612#(<= 49 main_~y~0)} is VALID [2022-04-15 06:15:51,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {13612#(<= 49 main_~y~0)} assume ~y~0 < 0; {13569#false} is VALID [2022-04-15 06:15:51,408 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-15 06:15:51,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-15 06:15:51,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-15 06:15:51,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-15 06:15:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:15:51,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:51,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-15 06:15:51,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-15 06:15:51,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-15 06:15:51,820 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-15 06:15:51,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {13640#(not (< main_~y~0 0))} assume ~y~0 < 0; {13569#false} is VALID [2022-04-15 06:15:51,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13640#(not (< main_~y~0 0))} is VALID [2022-04-15 06:15:51,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:51,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:15:51,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:51,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {13658#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:15:51,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13658#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:15:51,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-15 06:15:51,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-15 06:15:51,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-15 06:15:51,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-15 06:15:51,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13568#true} is VALID [2022-04-15 06:15:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:15:51,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978972049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:51,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:51,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:15:53,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:53,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821667758] [2022-04-15 06:15:53,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821667758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:53,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:53,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:15:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021259434] [2022-04-15 06:15:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:15:53,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:53,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:53,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:53,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:15:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:15:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2899, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:15:53,108 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:57,521 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-15 06:15:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:15:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:15:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2022-04-15 06:15:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2022-04-15 06:15:57,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 97 transitions. [2022-04-15 06:15:57,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:57,608 INFO L225 Difference]: With dead ends: 111 [2022-04-15 06:15:57,608 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 06:15:57,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=886, Invalid=9826, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:15:57,610 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:57,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:15:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 06:15:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-15 06:15:57,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:57,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,878 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,878 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:57,880 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 06:15:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 06:15:57,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:57,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:57,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-15 06:15:57,880 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-15 06:15:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:57,881 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 06:15:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 06:15:57,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:57,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:57,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:57,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2022-04-15 06:15:57,883 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 85 [2022-04-15 06:15:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:57,884 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2022-04-15 06:15:57,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:15:57,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 99 transitions. [2022-04-15 06:15:58,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2022-04-15 06:15:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 06:15:58,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:58,040 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:58,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:58,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:15:58,241 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -947904473, now seen corresponding path program 26 times [2022-04-15 06:15:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621384585] [2022-04-15 06:16:02,375 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:02,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:06,628 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:06,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:06,763 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1888842187, now seen corresponding path program 1 times [2022-04-15 06:16:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:06,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741921145] [2022-04-15 06:16:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:16:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:06,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-15 06:16:06,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-15 06:16:06,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-15 06:16:06,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:16:06,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-15 06:16:06,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-15 06:16:06,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-15 06:16:06,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-15 06:16:06,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14425#(= main_~x~0 0)} is VALID [2022-04-15 06:16:06,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {14425#(= main_~x~0 0)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14425#(= main_~x~0 0)} is VALID [2022-04-15 06:16:06,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {14425#(= main_~x~0 0)} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14425#(= main_~x~0 0)} is VALID [2022-04-15 06:16:06,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {14425#(= main_~x~0 0)} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:06,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:06,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14427#(<= 48 main_~y~0)} is VALID [2022-04-15 06:16:06,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {14427#(<= 48 main_~y~0)} assume ~y~0 < 0; {14421#false} is VALID [2022-04-15 06:16:06,825 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-15 06:16:06,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-15 06:16:06,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-15 06:16:06,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-15 06:16:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741921145] [2022-04-15 06:16:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741921145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:16:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599973216] [2022-04-15 06:16:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:06,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:06,827 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:16:06,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:16:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:06,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:16:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:06,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:07,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14420#true} is VALID [2022-04-15 06:16:07,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-15 06:16:07,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-15 06:16:07,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-15 06:16:07,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-15 06:16:07,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14447#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:07,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {14447#(<= main_~x~0 0)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14447#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:07,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {14447#(<= main_~x~0 0)} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14447#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:07,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {14447#(<= main_~x~0 0)} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:16:07,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:16:07,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14427#(<= 48 main_~y~0)} is VALID [2022-04-15 06:16:07,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {14427#(<= 48 main_~y~0)} assume ~y~0 < 0; {14421#false} is VALID [2022-04-15 06:16:07,059 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-15 06:16:07,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-15 06:16:07,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-15 06:16:07,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-15 06:16:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:07,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:16:07,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-15 06:16:07,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-15 06:16:07,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-15 06:16:07,346 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-15 06:16:07,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {14491#(not (< main_~y~0 0))} assume ~y~0 < 0; {14421#false} is VALID [2022-04-15 06:16:07,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14491#(not (< main_~y~0 0))} is VALID [2022-04-15 06:16:07,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:07,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:07,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:07,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {14509#(<= main_~x~0 48)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:07,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14509#(<= main_~x~0 48)} is VALID [2022-04-15 06:16:07,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-15 06:16:07,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-15 06:16:07,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-15 06:16:07,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-15 06:16:07,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14420#true} is VALID [2022-04-15 06:16:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:16:07,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599973216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:16:07,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:16:07,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:16:08,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621384585] [2022-04-15 06:16:08,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621384585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:08,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:08,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:16:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314569608] [2022-04-15 06:16:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 06:16:08,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:08,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:08,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:08,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:16:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:16:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=2980, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:16:08,652 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:13,747 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-04-15 06:16:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:16:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 06:16:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2022-04-15 06:16:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2022-04-15 06:16:13,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 100 transitions. [2022-04-15 06:16:13,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:13,829 INFO L225 Difference]: With dead ends: 114 [2022-04-15 06:16:13,829 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 06:16:13,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=968, Invalid=10374, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:16:13,830 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 61 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:13,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 124 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:16:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 06:16:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-04-15 06:16:14,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:16:14,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:14,110 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:14,111 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:14,112 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-15 06:16:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-15 06:16:14,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:14,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:14,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 06:16:14,113 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 06:16:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:14,114 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-15 06:16:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-15 06:16:14,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:14,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:14,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:16:14,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:16:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-15 06:16:14,116 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 88 [2022-04-15 06:16:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:16:14,116 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-15 06:16:14,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:14,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-15 06:16:14,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-15 06:16:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 06:16:14,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:16:14,274 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:16:14,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 06:16:14,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:16:14,474 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:16:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:16:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1320849149, now seen corresponding path program 27 times [2022-04-15 06:16:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989018912] [2022-04-15 06:16:14,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:15,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:15,082 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 99259083, now seen corresponding path program 1 times [2022-04-15 06:16:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:15,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970379957] [2022-04-15 06:16:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:16:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:15,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-15 06:16:15,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-15 06:16:15,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-15 06:16:15,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:16:15,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-15 06:16:15,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-15 06:16:15,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-15 06:16:15,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-15 06:16:15,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15300#(= main_~x~0 0)} is VALID [2022-04-15 06:16:15,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {15300#(= main_~x~0 0)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15300#(= main_~x~0 0)} is VALID [2022-04-15 06:16:15,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {15300#(= main_~x~0 0)} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15300#(= main_~x~0 0)} is VALID [2022-04-15 06:16:15,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {15300#(= main_~x~0 0)} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:16:15,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:16:15,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15302#(<= 48 main_~y~0)} is VALID [2022-04-15 06:16:15,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {15302#(<= 48 main_~y~0)} assume ~y~0 < 0; {15296#false} is VALID [2022-04-15 06:16:15,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-15 06:16:15,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-15 06:16:15,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-15 06:16:15,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-15 06:16:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970379957] [2022-04-15 06:16:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970379957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:16:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426652868] [2022-04-15 06:16:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:15,152 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:16:15,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:16:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:15,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:16:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:15,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:15,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15295#true} is VALID [2022-04-15 06:16:15,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-15 06:16:15,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-15 06:16:15,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-15 06:16:15,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-15 06:16:15,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15322#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:15,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {15322#(<= main_~x~0 0)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15322#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:15,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {15322#(<= main_~x~0 0)} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15322#(<= main_~x~0 0)} is VALID [2022-04-15 06:16:15,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {15322#(<= main_~x~0 0)} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:16:15,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:16:15,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15302#(<= 48 main_~y~0)} is VALID [2022-04-15 06:16:15,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {15302#(<= 48 main_~y~0)} assume ~y~0 < 0; {15296#false} is VALID [2022-04-15 06:16:15,354 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-15 06:16:15,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-15 06:16:15,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-15 06:16:15,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-15 06:16:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:15,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:16:15,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-15 06:16:15,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-15 06:16:15,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-15 06:16:15,768 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-15 06:16:15,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {15366#(not (< main_~y~0 0))} assume ~y~0 < 0; {15296#false} is VALID [2022-04-15 06:16:15,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15366#(not (< main_~y~0 0))} is VALID [2022-04-15 06:16:15,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:15,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:15,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:15,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {15384#(<= main_~x~0 48)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:15,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15384#(<= main_~x~0 48)} is VALID [2022-04-15 06:16:15,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-15 06:16:15,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-15 06:16:15,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-15 06:16:15,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-15 06:16:15,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15295#true} is VALID [2022-04-15 06:16:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:16:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426652868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:16:15,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:16:15,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:16:17,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989018912] [2022-04-15 06:16:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989018912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:16:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978843050] [2022-04-15 06:16:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 06:16:17,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:17,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:17,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:16:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:16:17,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:16:17,152 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:23,562 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-15 06:16:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:16:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 06:16:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2022-04-15 06:16:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2022-04-15 06:16:23,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 103 transitions. [2022-04-15 06:16:23,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:23,674 INFO L225 Difference]: With dead ends: 117 [2022-04-15 06:16:23,674 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 06:16:23,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 06:16:23,676 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:23,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 170 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 06:16:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 06:16:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-15 06:16:24,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:16:24,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:24,044 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:24,044 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:24,045 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-04-15 06:16:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-15 06:16:24,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:24,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:24,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 06:16:24,046 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 06:16:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:24,047 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-04-15 06:16:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-15 06:16:24,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:24,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:24,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:16:24,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:16:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-15 06:16:24,049 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 91 [2022-04-15 06:16:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:16:24,049 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-15 06:16:24,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:24,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 105 transitions. [2022-04-15 06:16:24,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 06:16:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 06:16:24,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:16:24,193 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:16:24,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:16:24,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:24,394 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:16:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:16:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash -635297113, now seen corresponding path program 28 times [2022-04-15 06:16:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:24,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778888535] [2022-04-15 06:16:28,537 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:28,657 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:32,813 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:32,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:32,957 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1690324021, now seen corresponding path program 1 times [2022-04-15 06:16:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:32,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729307929] [2022-04-15 06:16:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:16:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:33,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-15 06:16:33,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-15 06:16:33,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-15 06:16:33,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:16:33,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-15 06:16:33,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-15 06:16:33,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-15 06:16:33,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-15 06:16:33,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16199#(= main_~x~0 0)} is VALID [2022-04-15 06:16:33,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {16199#(= main_~x~0 0)} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16199#(= main_~x~0 0)} is VALID [2022-04-15 06:16:33,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {16199#(= main_~x~0 0)} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16199#(= main_~x~0 0)} is VALID [2022-04-15 06:16:33,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {16199#(= main_~x~0 0)} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:33,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:33,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16201#(<= 48 main_~y~0)} is VALID [2022-04-15 06:16:33,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {16201#(<= 48 main_~y~0)} assume ~y~0 < 0; {16195#false} is VALID [2022-04-15 06:16:33,047 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-15 06:16:33,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-15 06:16:33,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-15 06:16:33,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-15 06:16:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:33,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729307929] [2022-04-15 06:16:33,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729307929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:16:33,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751435050] [2022-04-15 06:16:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:33,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:33,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:33,054 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:16:33,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:16:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:33,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:16:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:33,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:33,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16194#true} is VALID [2022-04-15 06:16:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-15 06:16:33,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-15 06:16:33,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-15 06:16:33,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-15 06:16:33,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:33,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:33,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:33,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:16:33,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:16:33,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16238#(<= 49 main_~y~0)} is VALID [2022-04-15 06:16:33,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {16238#(<= 49 main_~y~0)} assume ~y~0 < 0; {16195#false} is VALID [2022-04-15 06:16:33,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-15 06:16:33,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-15 06:16:33,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-15 06:16:33,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-15 06:16:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:33,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:16:33,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-15 06:16:33,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-15 06:16:33,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-15 06:16:33,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-15 06:16:33,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {16266#(not (< main_~y~0 0))} assume ~y~0 < 0; {16195#false} is VALID [2022-04-15 06:16:33,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16266#(not (< main_~y~0 0))} is VALID [2022-04-15 06:16:33,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:33,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:33,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:33,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {16284#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:33,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16284#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:16:33,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-15 06:16:33,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-15 06:16:33,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-15 06:16:33,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-15 06:16:33,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16194#true} is VALID [2022-04-15 06:16:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:16:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751435050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:16:33,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:16:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:16:35,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778888535] [2022-04-15 06:16:35,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778888535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:35,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:35,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:16:35,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051917626] [2022-04-15 06:16:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 06:16:35,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:35,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:35,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:35,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:16:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:16:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=3576, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:16:35,636 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:42,099 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-04-15 06:16:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:16:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 06:16:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 106 transitions. [2022-04-15 06:16:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 106 transitions. [2022-04-15 06:16:42,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 106 transitions. [2022-04-15 06:16:42,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:42,199 INFO L225 Difference]: With dead ends: 120 [2022-04-15 06:16:42,199 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 06:16:42,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3794 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=998, Invalid=12342, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:16:42,201 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3336 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:42,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 61 Invalid, 3469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3336 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 06:16:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 06:16:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-15 06:16:42,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:16:42,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,579 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,579 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:42,580 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 06:16:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 06:16:42,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:42,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:42,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 06:16:42,581 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 06:16:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:42,582 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 06:16:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 06:16:42,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:42,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:42,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:16:42,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:16:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-15 06:16:42,601 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 94 [2022-04-15 06:16:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:16:42,601 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-15 06:16:42,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:42,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-15 06:16:42,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-15 06:16:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 06:16:42,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:16:42,773 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:16:42,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 06:16:42,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:42,974 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:16:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:16:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 75914883, now seen corresponding path program 29 times [2022-04-15 06:16:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:42,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24409156] [2022-04-15 06:16:43,252 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:47,386 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:47,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:16:47,513 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 815060171, now seen corresponding path program 1 times [2022-04-15 06:16:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361585037] [2022-04-15 06:16:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:16:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:47,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-15 06:16:47,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-15 06:16:47,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-15 06:16:47,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:16:47,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-15 06:16:47,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-15 06:16:47,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-15 06:16:47,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-15 06:16:47,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17123#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:16:47,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {17123#(and (= main_~x~0 0) (= main_~y~0 0))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17126#(<= 49 main_~y~0)} is VALID [2022-04-15 06:16:47,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {17126#(<= 49 main_~y~0)} assume ~y~0 < 0; {17119#false} is VALID [2022-04-15 06:16:47,618 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-15 06:16:47,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-15 06:16:47,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-15 06:16:47,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-15 06:16:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:16:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361585037] [2022-04-15 06:16:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361585037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:16:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576851383] [2022-04-15 06:16:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:47,621 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:16:47,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:16:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:47,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:16:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:47,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:47,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17118#true} is VALID [2022-04-15 06:16:47,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-15 06:16:47,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-15 06:16:47,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-15 06:16:47,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-15 06:16:47,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:47,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:16:48,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:16:48,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:16:48,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17126#(<= 49 main_~y~0)} is VALID [2022-04-15 06:16:48,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {17126#(<= 49 main_~y~0)} assume ~y~0 < 0; {17119#false} is VALID [2022-04-15 06:16:48,002 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-15 06:16:48,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-15 06:16:48,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-15 06:16:48,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-15 06:16:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:16:48,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:16:48,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-15 06:16:48,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-15 06:16:48,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-15 06:16:48,473 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-15 06:16:48,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {17190#(not (< main_~y~0 0))} assume ~y~0 < 0; {17119#false} is VALID [2022-04-15 06:16:48,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17190#(not (< main_~y~0 0))} is VALID [2022-04-15 06:16:48,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:48,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:16:48,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:48,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {17208#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:16:48,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17208#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:16:48,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-15 06:16:48,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-15 06:16:48,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-15 06:16:48,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-15 06:16:48,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17118#true} is VALID [2022-04-15 06:16:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:16:48,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576851383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:16:48,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:16:48,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2022-04-15 06:16:50,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:50,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24409156] [2022-04-15 06:16:50,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24409156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:50,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:50,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:16:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104822290] [2022-04-15 06:16:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:16:50,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:50,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:50,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:50,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:16:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:16:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3934, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:16:50,463 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:59,724 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2022-04-15 06:16:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:16:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:16:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 109 transitions. [2022-04-15 06:16:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:16:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 109 transitions. [2022-04-15 06:16:59,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 109 transitions. [2022-04-15 06:16:59,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:59,825 INFO L225 Difference]: With dead ends: 123 [2022-04-15 06:16:59,825 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 06:16:59,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2429 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1103, Invalid=13903, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 06:16:59,827 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4884 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 4998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:59,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 212 Invalid, 4998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4884 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 06:16:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 06:17:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-15 06:17:00,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:00,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:00,219 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:00,220 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:00,221 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-15 06:17:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-15 06:17:00,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:00,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:00,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-15 06:17:00,222 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-15 06:17:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:00,223 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-15 06:17:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-15 06:17:00,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:00,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:00,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:00,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-04-15 06:17:00,225 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 97 [2022-04-15 06:17:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:00,225 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-04-15 06:17:00,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:00,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 111 transitions. [2022-04-15 06:17:00,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-15 06:17:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 06:17:00,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:00,385 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:00,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:00,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:00,586 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 718816551, now seen corresponding path program 30 times [2022-04-15 06:17:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172755504] [2022-04-15 06:17:00,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:01,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:01,171 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -974522933, now seen corresponding path program 1 times [2022-04-15 06:17:01,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:01,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099750739] [2022-04-15 06:17:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:01,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-15 06:17:01,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-15 06:17:01,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-15 06:17:01,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:01,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-15 06:17:01,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-15 06:17:01,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-15 06:17:01,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-15 06:17:01,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18076#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:17:01,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {18076#(and (= main_~x~0 0) (= main_~y~0 0))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18077#(= main_~x~0 0)} is VALID [2022-04-15 06:17:01,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {18077#(= main_~x~0 0)} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18077#(= main_~x~0 0)} is VALID [2022-04-15 06:17:01,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {18077#(= main_~x~0 0)} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:01,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:01,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18079#(<= 48 main_~y~0)} is VALID [2022-04-15 06:17:01,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {18079#(<= 48 main_~y~0)} assume ~y~0 < 0; {18072#false} is VALID [2022-04-15 06:17:01,237 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-15 06:17:01,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-15 06:17:01,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-15 06:17:01,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-15 06:17:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:01,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:01,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099750739] [2022-04-15 06:17:01,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099750739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:01,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438055230] [2022-04-15 06:17:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:01,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:01,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:01,239 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:01,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:17:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:01,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:17:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:01,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:01,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18071#true} is VALID [2022-04-15 06:17:01,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-15 06:17:01,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-15 06:17:01,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-15 06:17:01,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-15 06:17:01,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:01,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:01,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:01,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:01,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:01,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18116#(<= 49 main_~y~0)} is VALID [2022-04-15 06:17:01,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {18116#(<= 49 main_~y~0)} assume ~y~0 < 0; {18072#false} is VALID [2022-04-15 06:17:01,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-15 06:17:01,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-15 06:17:01,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-15 06:17:01,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-15 06:17:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:01,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:02,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-15 06:17:02,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-15 06:17:02,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-15 06:17:02,191 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-15 06:17:02,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {18144#(not (< main_~y~0 0))} assume ~y~0 < 0; {18072#false} is VALID [2022-04-15 06:17:02,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18144#(not (< main_~y~0 0))} is VALID [2022-04-15 06:17:02,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:02,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:02,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:02,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {18162#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:02,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18162#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:17:02,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-15 06:17:02,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-15 06:17:02,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-15 06:17:02,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-15 06:17:02,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18071#true} is VALID [2022-04-15 06:17:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438055230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:02,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:17:04,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:04,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172755504] [2022-04-15 06:17:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172755504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:04,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:17:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382707201] [2022-04-15 06:17:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 06:17:04,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:04,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:04,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:04,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:17:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:17:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4321, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:17:04,344 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:14,587 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-04-15 06:17:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:17:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 06:17:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2022-04-15 06:17:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2022-04-15 06:17:14,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 112 transitions. [2022-04-15 06:17:14,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:14,732 INFO L225 Difference]: With dead ends: 126 [2022-04-15 06:17:14,732 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 06:17:14,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1146, Invalid=15110, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:17:14,734 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:14,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 333 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 06:17:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 06:17:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-04-15 06:17:15,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:15,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:15,141 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:15,141 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:15,143 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-15 06:17:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-15 06:17:15,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:15,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:15,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 06:17:15,144 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 06:17:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:15,145 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-15 06:17:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-15 06:17:15,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:15,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:15,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:15,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-15 06:17:15,147 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 100 [2022-04-15 06:17:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:15,155 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-15 06:17:15,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:15,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-15 06:17:15,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 06:17:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 06:17:15,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:15,521 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:15,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:15,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:15,722 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2143235075, now seen corresponding path program 31 times [2022-04-15 06:17:15,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:15,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463791215] [2022-04-15 06:17:19,930 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:17:20,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:20,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:20,355 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1530861259, now seen corresponding path program 1 times [2022-04-15 06:17:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:20,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748178410] [2022-04-15 06:17:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:20,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-15 06:17:20,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-15 06:17:20,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-15 06:17:20,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:20,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-15 06:17:20,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-15 06:17:20,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-15 06:17:20,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-15 06:17:20,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:17:20,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:17:20,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:17:20,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:20,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:20,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19056#(<= 49 main_~y~0)} is VALID [2022-04-15 06:17:20,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {19056#(<= 49 main_~y~0)} assume ~y~0 < 0; {19050#false} is VALID [2022-04-15 06:17:20,457 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-15 06:17:20,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-15 06:17:20,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-15 06:17:20,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-15 06:17:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748178410] [2022-04-15 06:17:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748178410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340149260] [2022-04-15 06:17:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:20,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:20,476 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:20,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:17:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:20,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:17:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:20,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:20,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19049#true} is VALID [2022-04-15 06:17:20,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-15 06:17:20,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-15 06:17:20,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-15 06:17:20,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-15 06:17:20,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:20,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:20,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:20,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:20,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:20,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19056#(<= 49 main_~y~0)} is VALID [2022-04-15 06:17:20,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {19056#(<= 49 main_~y~0)} assume ~y~0 < 0; {19050#false} is VALID [2022-04-15 06:17:20,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-15 06:17:20,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-15 06:17:20,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-15 06:17:20,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-15 06:17:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:20,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:21,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-15 06:17:21,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-15 06:17:21,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-15 06:17:21,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-15 06:17:21,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {19120#(not (< main_~y~0 0))} assume ~y~0 < 0; {19050#false} is VALID [2022-04-15 06:17:21,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19120#(not (< main_~y~0 0))} is VALID [2022-04-15 06:17:21,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:21,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:21,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:21,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {19138#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:21,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19138#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:17:21,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-15 06:17:21,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-15 06:17:21,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-15 06:17:21,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-15 06:17:21,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19049#true} is VALID [2022-04-15 06:17:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340149260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:21,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:21,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:17:23,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463791215] [2022-04-15 06:17:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463791215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:23,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:17:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123900052] [2022-04-15 06:17:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 06:17:23,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:23,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:23,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:23,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:17:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:17:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=4319, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:17:23,576 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:33,888 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-04-15 06:17:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:17:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 06:17:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 115 transitions. [2022-04-15 06:17:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 115 transitions. [2022-04-15 06:17:33,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 115 transitions. [2022-04-15 06:17:33,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:33,993 INFO L225 Difference]: With dead ends: 129 [2022-04-15 06:17:33,993 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 06:17:33,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2541 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1168, Invalid=15602, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:17:33,994 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:33,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 139 Invalid, 5610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 5488 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 06:17:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 06:17:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-15 06:17:34,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:34,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:34,406 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:34,406 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:34,407 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-04-15 06:17:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-15 06:17:34,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:34,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:34,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 06:17:34,408 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 06:17:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:34,409 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-04-15 06:17:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-15 06:17:34,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:34,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:34,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:34,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2022-04-15 06:17:34,413 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 103 [2022-04-15 06:17:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:34,414 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2022-04-15 06:17:34,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:34,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 117 transitions. [2022-04-15 06:17:34,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-04-15 06:17:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 06:17:34,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:34,592 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:34,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:34,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-15 06:17:34,793 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1576368217, now seen corresponding path program 32 times [2022-04-15 06:17:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270414525] [2022-04-15 06:17:37,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:37,612 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:37,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash -258721845, now seen corresponding path program 1 times [2022-04-15 06:17:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:37,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286524709] [2022-04-15 06:17:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:37,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-15 06:17:37,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:17:37,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-15 06:17:37,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:37,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-15 06:17:37,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:17:37,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-15 06:17:37,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-15 06:17:37,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:17:37,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {20054#(and (= main_~x~0 0) (= main_~y~0 0))} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:37,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:37,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:37,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:37,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20057#(<= 49 main_~y~0)} is VALID [2022-04-15 06:17:37,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {20057#(<= 49 main_~y~0)} assume ~y~0 < 0; {20050#false} is VALID [2022-04-15 06:17:37,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-15 06:17:37,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-15 06:17:37,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-15 06:17:37,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-15 06:17:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:37,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286524709] [2022-04-15 06:17:37,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286524709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:37,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326927095] [2022-04-15 06:17:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:37,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:37,712 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:37,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:17:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:37,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:17:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:38,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20049#true} is VALID [2022-04-15 06:17:38,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-15 06:17:38,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:17:38,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-15 06:17:38,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-15 06:17:38,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20077#(<= main_~x~0 0)} is VALID [2022-04-15 06:17:38,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {20077#(<= main_~x~0 0)} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20077#(<= main_~x~0 0)} is VALID [2022-04-15 06:17:38,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {20077#(<= main_~x~0 0)} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20077#(<= main_~x~0 0)} is VALID [2022-04-15 06:17:38,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {20077#(<= main_~x~0 0)} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:17:38,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:17:38,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20094#(<= 48 main_~y~0)} is VALID [2022-04-15 06:17:38,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {20094#(<= 48 main_~y~0)} assume ~y~0 < 0; {20050#false} is VALID [2022-04-15 06:17:38,190 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-15 06:17:38,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-15 06:17:38,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-15 06:17:38,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-15 06:17:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:38,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:38,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-15 06:17:38,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-15 06:17:38,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-15 06:17:38,711 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-15 06:17:38,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {20122#(not (< main_~y~0 0))} assume ~y~0 < 0; {20050#false} is VALID [2022-04-15 06:17:38,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20122#(not (< main_~y~0 0))} is VALID [2022-04-15 06:17:38,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:38,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:38,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:38,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {20140#(<= main_~x~0 48)} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:38,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20140#(<= main_~x~0 48)} is VALID [2022-04-15 06:17:38,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-15 06:17:38,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-15 06:17:38,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-15 06:17:38,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-15 06:17:38,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20049#true} is VALID [2022-04-15 06:17:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:38,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326927095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:38,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:38,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:17:41,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:41,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270414525] [2022-04-15 06:17:41,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270414525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:41,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:41,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:17:41,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485452768] [2022-04-15 06:17:41,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 06:17:41,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:41,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:41,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:41,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:17:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:17:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4862, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:17:41,186 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:52,781 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-04-15 06:17:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:17:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 06:17:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2022-04-15 06:17:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2022-04-15 06:17:52,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 118 transitions. [2022-04-15 06:17:52,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:52,930 INFO L225 Difference]: With dead ends: 132 [2022-04-15 06:17:52,930 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 06:17:52,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1221, Invalid=17139, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:17:52,931 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 6051 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 6177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:52,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 6177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6051 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 06:17:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 06:17:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-04-15 06:17:53,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:53,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:53,408 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:53,408 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:53,410 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:17:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:17:53,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:53,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:53,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 06:17:53,410 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 06:17:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:53,412 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:17:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:17:53,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:53,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:53,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:53,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-15 06:17:53,414 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 106 [2022-04-15 06:17:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:53,414 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-15 06:17:53,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:17:53,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-15 06:17:53,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-15 06:17:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 06:17:53,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:53,588 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:53,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:53,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:53,789 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2121803389, now seen corresponding path program 33 times [2022-04-15 06:17:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:53,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140941817] [2022-04-15 06:17:57,943 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:17:58,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:58,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:17:58,287 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2048304949, now seen corresponding path program 1 times [2022-04-15 06:17:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144570380] [2022-04-15 06:17:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:58,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-15 06:17:58,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-15 06:17:58,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-15 06:17:58,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:58,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-15 06:17:58,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-15 06:17:58,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-15 06:17:58,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-15 06:17:58,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21080#(= main_~x~0 0)} is VALID [2022-04-15 06:17:58,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {21080#(= main_~x~0 0)} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21080#(= main_~x~0 0)} is VALID [2022-04-15 06:17:58,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {21080#(= main_~x~0 0)} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21080#(= main_~x~0 0)} is VALID [2022-04-15 06:17:58,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {21080#(= main_~x~0 0)} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:58,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:58,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21082#(<= 48 main_~y~0)} is VALID [2022-04-15 06:17:58,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {21082#(<= 48 main_~y~0)} assume ~y~0 < 0; {21076#false} is VALID [2022-04-15 06:17:58,343 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-15 06:17:58,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-15 06:17:58,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-15 06:17:58,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-15 06:17:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144570380] [2022-04-15 06:17:58,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144570380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711214795] [2022-04-15 06:17:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:58,348 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:58,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:17:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:58,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:17:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:58,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:58,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21075#true} is VALID [2022-04-15 06:17:58,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-15 06:17:58,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-15 06:17:58,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-15 06:17:58,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-15 06:17:58,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:58,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:58,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:17:58,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:58,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:17:58,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21119#(<= 49 main_~y~0)} is VALID [2022-04-15 06:17:58,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {21119#(<= 49 main_~y~0)} assume ~y~0 < 0; {21076#false} is VALID [2022-04-15 06:17:58,655 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-15 06:17:58,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-15 06:17:58,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-15 06:17:58,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-15 06:17:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:17:58,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:59,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-15 06:17:59,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-15 06:17:59,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-15 06:17:59,035 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-15 06:17:59,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {21147#(not (< main_~y~0 0))} assume ~y~0 < 0; {21076#false} is VALID [2022-04-15 06:17:59,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21147#(not (< main_~y~0 0))} is VALID [2022-04-15 06:17:59,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:59,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:17:59,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:59,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {21165#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:17:59,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21165#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:17:59,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-15 06:17:59,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-15 06:17:59,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-15 06:17:59,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-15 06:17:59,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21075#true} is VALID [2022-04-15 06:17:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:17:59,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711214795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:59,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:18:00,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140941817] [2022-04-15 06:18:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140941817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:00,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:00,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 06:18:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248048510] [2022-04-15 06:18:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 06:18:00,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:00,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:00,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:00,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 06:18:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 06:18:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=4866, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:18:00,992 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:08,598 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-04-15 06:18:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:18:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 06:18:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 121 transitions. [2022-04-15 06:18:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 121 transitions. [2022-04-15 06:18:08,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 121 transitions. [2022-04-15 06:18:08,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:08,692 INFO L225 Difference]: With dead ends: 135 [2022-04-15 06:18:08,692 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:18:08,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5294 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1183, Invalid=17177, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:18:08,693 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4567 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 4702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:08,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 226 Invalid, 4702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4567 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:18:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:18:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-15 06:18:09,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:09,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:09,134 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:09,134 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:09,135 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-04-15 06:18:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-15 06:18:09,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:09,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:09,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-15 06:18:09,135 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-15 06:18:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:09,137 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-04-15 06:18:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-15 06:18:09,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:09,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:09,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:09,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-04-15 06:18:09,139 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 109 [2022-04-15 06:18:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:09,139 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-04-15 06:18:09,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:09,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 123 transitions. [2022-04-15 06:18:09,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-04-15 06:18:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 06:18:09,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:09,289 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:09,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 06:18:09,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:09,490 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash 975235623, now seen corresponding path program 34 times [2022-04-15 06:18:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:09,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875722311] [2022-04-15 06:18:09,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:13,854 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:18:13,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:13,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 457079243, now seen corresponding path program 1 times [2022-04-15 06:18:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827879025] [2022-04-15 06:18:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:14,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-15 06:18:14,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-15 06:18:14,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-15 06:18:14,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:14,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-15 06:18:14,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-15 06:18:14,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-15 06:18:14,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-15 06:18:14,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22124#(= main_~x~0 0)} is VALID [2022-04-15 06:18:14,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {22124#(= main_~x~0 0)} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22124#(= main_~x~0 0)} is VALID [2022-04-15 06:18:14,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {22124#(= main_~x~0 0)} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22124#(= main_~x~0 0)} is VALID [2022-04-15 06:18:14,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {22124#(= main_~x~0 0)} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:14,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:14,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22126#(<= 48 main_~y~0)} is VALID [2022-04-15 06:18:14,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {22126#(<= 48 main_~y~0)} assume ~y~0 < 0; {22120#false} is VALID [2022-04-15 06:18:14,047 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-15 06:18:14,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-15 06:18:14,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-15 06:18:14,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-15 06:18:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:14,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827879025] [2022-04-15 06:18:14,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827879025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:14,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516180204] [2022-04-15 06:18:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:14,052 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:14,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:18:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:14,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:18:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:14,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:14,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22119#true} is VALID [2022-04-15 06:18:14,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-15 06:18:14,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-15 06:18:14,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-15 06:18:14,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-15 06:18:14,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:18:14,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:18:14,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:18:14,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:18:14,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:18:14,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22163#(<= 49 main_~y~0)} is VALID [2022-04-15 06:18:14,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {22163#(<= 49 main_~y~0)} assume ~y~0 < 0; {22120#false} is VALID [2022-04-15 06:18:14,301 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-15 06:18:14,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-15 06:18:14,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-15 06:18:14,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-15 06:18:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:14,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:14,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-15 06:18:14,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-15 06:18:14,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-15 06:18:14,683 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-15 06:18:14,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {22191#(not (< main_~y~0 0))} assume ~y~0 < 0; {22120#false} is VALID [2022-04-15 06:18:14,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22191#(not (< main_~y~0 0))} is VALID [2022-04-15 06:18:14,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:14,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:14,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:14,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {22209#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:14,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22209#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:18:14,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-15 06:18:14,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-15 06:18:14,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-15 06:18:14,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-15 06:18:14,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22119#true} is VALID [2022-04-15 06:18:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:18:14,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516180204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:14,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:14,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:18:16,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:16,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875722311] [2022-04-15 06:18:16,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875722311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:16,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:16,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:18:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972232663] [2022-04-15 06:18:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 06:18:16,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:16,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:16,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:16,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:18:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:18:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=5148, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:18:16,802 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:25,191 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-15 06:18:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 06:18:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 06:18:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2022-04-15 06:18:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2022-04-15 06:18:25,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 124 transitions. [2022-04-15 06:18:25,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:25,288 INFO L225 Difference]: With dead ends: 138 [2022-04-15 06:18:25,288 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 06:18:25,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1220, Invalid=18240, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 06:18:25,289 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 77 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:25,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 177 Invalid, 5267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 06:18:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 06:18:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-04-15 06:18:25,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:25,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,698 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,698 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:25,699 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2022-04-15 06:18:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-04-15 06:18:25,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:25,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:25,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-15 06:18:25,700 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-15 06:18:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:25,702 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2022-04-15 06:18:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-04-15 06:18:25,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:25,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:25,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:25,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-04-15 06:18:25,704 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 112 [2022-04-15 06:18:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:25,704 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-04-15 06:18:25,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:25,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 126 transitions. [2022-04-15 06:18:25,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-04-15 06:18:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 06:18:25,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:25,864 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:25,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:26,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:18:26,082 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 376989443, now seen corresponding path program 35 times [2022-04-15 06:18:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822588709] [2022-04-15 06:18:26,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:30,426 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:18:30,530 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:30,531 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1332503861, now seen corresponding path program 1 times [2022-04-15 06:18:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367091622] [2022-04-15 06:18:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:30,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-15 06:18:30,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-15 06:18:30,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-15 06:18:30,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:30,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-15 06:18:30,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-15 06:18:30,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-15 06:18:30,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-15 06:18:30,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23192#(= main_~x~0 0)} is VALID [2022-04-15 06:18:30,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {23192#(= main_~x~0 0)} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23192#(= main_~x~0 0)} is VALID [2022-04-15 06:18:30,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {23192#(= main_~x~0 0)} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23192#(= main_~x~0 0)} is VALID [2022-04-15 06:18:30,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {23192#(= main_~x~0 0)} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:18:30,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:18:30,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23194#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-15 06:18:30,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {23194#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {23188#false} is VALID [2022-04-15 06:18:30,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-15 06:18:30,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-15 06:18:30,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-15 06:18:30,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-15 06:18:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:30,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367091622] [2022-04-15 06:18:30,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367091622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:30,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037416708] [2022-04-15 06:18:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:30,599 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:30,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:18:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:30,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:18:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:30,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:30,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23187#true} is VALID [2022-04-15 06:18:30,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-15 06:18:30,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-15 06:18:30,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-15 06:18:30,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-15 06:18:30,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:30,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:30,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:30,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:18:30,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:18:30,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23231#(<= 49 main_~y~0)} is VALID [2022-04-15 06:18:30,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {23231#(<= 49 main_~y~0)} assume ~y~0 < 0; {23188#false} is VALID [2022-04-15 06:18:30,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-15 06:18:30,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-15 06:18:30,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-15 06:18:30,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-15 06:18:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:30,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:31,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-15 06:18:31,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-15 06:18:31,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-15 06:18:31,271 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-15 06:18:31,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(not (< main_~y~0 0))} assume ~y~0 < 0; {23188#false} is VALID [2022-04-15 06:18:31,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23259#(not (< main_~y~0 0))} is VALID [2022-04-15 06:18:31,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:31,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:31,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:31,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {23277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:31,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:18:31,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-15 06:18:31,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-15 06:18:31,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-15 06:18:31,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-15 06:18:31,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23187#true} is VALID [2022-04-15 06:18:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:18:31,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037416708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:31,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:31,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:18:33,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:33,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822588709] [2022-04-15 06:18:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822588709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 06:18:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255139212] [2022-04-15 06:18:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 06:18:33,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:33,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:33,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:33,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 06:18:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 06:18:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 06:18:33,454 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:41,617 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-04-15 06:18:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:18:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 06:18:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 127 transitions. [2022-04-15 06:18:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 127 transitions. [2022-04-15 06:18:41,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 127 transitions. [2022-04-15 06:18:41,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:41,716 INFO L225 Difference]: With dead ends: 141 [2022-04-15 06:18:41,716 INFO L226 Difference]: Without dead ends: 126 [2022-04-15 06:18:41,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5826 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1256, Invalid=19336, Unknown=0, NotChecked=0, Total=20592 [2022-04-15 06:18:41,717 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4918 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 4918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:41,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 68 Invalid, 5085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 4918 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 06:18:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-15 06:18:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-04-15 06:18:42,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:42,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:42,159 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:42,159 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:42,161 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-15 06:18:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-15 06:18:42,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:42,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:42,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-15 06:18:42,161 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-15 06:18:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:42,162 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-15 06:18:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-15 06:18:42,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:42,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:42,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:42,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-04-15 06:18:42,164 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 115 [2022-04-15 06:18:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:42,164 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-04-15 06:18:42,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:42,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 129 transitions. [2022-04-15 06:18:42,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-04-15 06:18:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 06:18:42,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:42,324 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:42,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 06:18:42,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:18:42,528 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2139319463, now seen corresponding path program 36 times [2022-04-15 06:18:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:42,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293977616] [2022-04-15 06:18:42,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:42,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:42,958 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1172880331, now seen corresponding path program 1 times [2022-04-15 06:18:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172258657] [2022-04-15 06:18:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:43,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-15 06:18:43,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-15 06:18:43,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-15 06:18:43,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:43,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-15 06:18:43,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-15 06:18:43,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-15 06:18:43,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-15 06:18:43,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24284#(= main_~x~0 0)} is VALID [2022-04-15 06:18:43,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {24284#(= main_~x~0 0)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24284#(= main_~x~0 0)} is VALID [2022-04-15 06:18:43,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {24284#(= main_~x~0 0)} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24284#(= main_~x~0 0)} is VALID [2022-04-15 06:18:43,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {24284#(= main_~x~0 0)} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:43,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:43,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24286#(<= 48 main_~y~0)} is VALID [2022-04-15 06:18:43,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {24286#(<= 48 main_~y~0)} assume ~y~0 < 0; {24280#false} is VALID [2022-04-15 06:18:43,033 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-15 06:18:43,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-15 06:18:43,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-15 06:18:43,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-15 06:18:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172258657] [2022-04-15 06:18:43,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172258657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:43,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080201665] [2022-04-15 06:18:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:43,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:43,035 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:43,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:18:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:43,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:18:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:43,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:43,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24279#true} is VALID [2022-04-15 06:18:43,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-15 06:18:43,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-15 06:18:43,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-15 06:18:43,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-15 06:18:43,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24306#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:43,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {24306#(<= main_~x~0 0)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24306#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:43,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {24306#(<= main_~x~0 0)} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24306#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:43,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {24306#(<= main_~x~0 0)} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:18:43,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:18:43,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24286#(<= 48 main_~y~0)} is VALID [2022-04-15 06:18:43,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {24286#(<= 48 main_~y~0)} assume ~y~0 < 0; {24280#false} is VALID [2022-04-15 06:18:43,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-15 06:18:43,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-15 06:18:43,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-15 06:18:43,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-15 06:18:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:43,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:43,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-15 06:18:43,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-15 06:18:43,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-15 06:18:43,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-15 06:18:43,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {24350#(not (< main_~y~0 0))} assume ~y~0 < 0; {24280#false} is VALID [2022-04-15 06:18:43,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24350#(not (< main_~y~0 0))} is VALID [2022-04-15 06:18:43,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:43,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:43,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:43,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {24368#(<= main_~x~0 48)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:18:43,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24368#(<= main_~x~0 48)} is VALID [2022-04-15 06:18:43,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-15 06:18:43,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-15 06:18:43,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-15 06:18:43,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-15 06:18:43,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24279#true} is VALID [2022-04-15 06:18:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:18:43,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080201665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:43,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:43,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:18:45,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293977616] [2022-04-15 06:18:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293977616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-15 06:18:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907064943] [2022-04-15 06:18:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 06:18:45,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:45,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:45,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:45,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-15 06:18:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:45,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-15 06:18:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5550, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:18:45,757 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:55,018 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2022-04-15 06:18:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 06:18:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 06:18:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-15 06:18:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-15 06:18:55,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-15 06:18:55,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:55,156 INFO L225 Difference]: With dead ends: 144 [2022-04-15 06:18:55,156 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 06:18:55,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6169 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1358, Invalid=20104, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 06:18:55,158 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:55,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 119 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 06:18:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 06:18:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-04-15 06:18:55,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:55,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,713 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,714 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:55,715 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 06:18:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 06:18:55,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:55,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:55,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 06:18:55,716 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 06:18:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:55,717 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 06:18:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 06:18:55,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:55,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:55,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:55,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-15 06:18:55,720 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 118 [2022-04-15 06:18:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:55,720 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-15 06:18:55,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:18:55,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-15 06:18:55,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-15 06:18:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 06:18:55,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:55,947 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:55,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:56,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:18:56,147 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2032718979, now seen corresponding path program 37 times [2022-04-15 06:18:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123719267] [2022-04-15 06:18:56,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:56,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:18:56,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -616702773, now seen corresponding path program 1 times [2022-04-15 06:18:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:56,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046054211] [2022-04-15 06:18:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:56,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-15 06:18:56,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-15 06:18:56,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-15 06:18:56,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:56,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-15 06:18:56,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-15 06:18:56,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-15 06:18:56,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-15 06:18:56,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25399#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:18:56,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {25399#(and (= main_~x~0 0) (= main_~y~0 0))} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:56,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:18:56,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:56,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:56,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25402#(<= 0 main_~y~0)} is VALID [2022-04-15 06:18:56,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {25402#(<= 0 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-15 06:18:56,796 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-15 06:18:56,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-15 06:18:56,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-15 06:18:56,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-15 06:18:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:18:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046054211] [2022-04-15 06:18:56,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046054211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472046680] [2022-04-15 06:18:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:56,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:56,799 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:18:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:56,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:18:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:56,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:56,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25394#true} is VALID [2022-04-15 06:18:56,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-15 06:18:56,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-15 06:18:56,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-15 06:18:56,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-15 06:18:56,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25422#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:56,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {25422#(<= main_~x~0 0)} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25422#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:56,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {25422#(<= main_~x~0 0)} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25422#(<= main_~x~0 0)} is VALID [2022-04-15 06:18:56,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {25422#(<= main_~x~0 0)} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:18:56,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:18:56,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25439#(<= 48 main_~y~0)} is VALID [2022-04-15 06:18:56,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {25439#(<= 48 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-15 06:18:56,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-15 06:18:56,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-15 06:18:56,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-15 06:18:56,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-15 06:18:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:18:56,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:57,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-15 06:18:57,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-15 06:18:57,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-15 06:18:57,375 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-15 06:18:57,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {25402#(<= 0 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-15 06:18:57,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25402#(<= 0 main_~y~0)} is VALID [2022-04-15 06:18:57,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:57,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:18:57,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-15 06:18:57,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {25483#(<= main_~x~0 48)} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-15 06:18:57,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25483#(<= main_~x~0 48)} is VALID [2022-04-15 06:18:57,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-15 06:18:57,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-15 06:18:57,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-15 06:18:57,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-15 06:18:57,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25394#true} is VALID [2022-04-15 06:18:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:18:57,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472046680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:57,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:57,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-15 06:18:59,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:59,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123719267] [2022-04-15 06:18:59,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123719267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:59,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:59,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-15 06:18:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316091809] [2022-04-15 06:18:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:59,959 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 06:18:59,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:59,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:00,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:00,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-15 06:19:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-15 06:19:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=6104, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:19:00,041 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:13,394 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-04-15 06:19:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-15 06:19:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 06:19:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2022-04-15 06:19:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2022-04-15 06:19:13,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 133 transitions. [2022-04-15 06:19:13,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:13,504 INFO L225 Difference]: With dead ends: 146 [2022-04-15 06:19:13,504 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 06:19:13,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1334, Invalid=22536, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 06:19:13,506 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7654 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 7654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:13,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 64 Invalid, 7878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 7654 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 06:19:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 06:19:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-15 06:19:13,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:13,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,975 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,976 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:13,977 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-15 06:19:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-15 06:19:13,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:13,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:13,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 06:19:13,978 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 06:19:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:13,980 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-15 06:19:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-15 06:19:13,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:13,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:13,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:13,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-04-15 06:19:13,982 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 121 [2022-04-15 06:19:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:13,982 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-04-15 06:19:13,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:13,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 135 transitions. [2022-04-15 06:19:14,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-15 06:19:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 06:19:14,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:14,163 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:14,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:19:14,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:19:14,363 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 278531879, now seen corresponding path program 38 times [2022-04-15 06:19:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658126452] [2022-04-15 06:19:14,579 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:14,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:14,823 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1888681419, now seen corresponding path program 1 times [2022-04-15 06:19:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:14,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642925709] [2022-04-15 06:19:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:19:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:14,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-15 06:19:14,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-15 06:19:14,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-15 06:19:14,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:19:14,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-15 06:19:14,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-15 06:19:14,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-15 06:19:14,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-15 06:19:14,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26541#(= main_~x~0 0)} is VALID [2022-04-15 06:19:14,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {26541#(= main_~x~0 0)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26541#(= main_~x~0 0)} is VALID [2022-04-15 06:19:14,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {26541#(= main_~x~0 0)} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26541#(= main_~x~0 0)} is VALID [2022-04-15 06:19:14,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {26541#(= main_~x~0 0)} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:14,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:14,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26543#(<= 48 main_~y~0)} is VALID [2022-04-15 06:19:14,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {26543#(<= 48 main_~y~0)} assume ~y~0 < 0; {26537#false} is VALID [2022-04-15 06:19:14,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-15 06:19:14,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-15 06:19:14,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-15 06:19:14,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-15 06:19:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642925709] [2022-04-15 06:19:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642925709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:19:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837143615] [2022-04-15 06:19:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:14,887 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:19:14,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:19:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:19:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:14,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:15,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26536#true} is VALID [2022-04-15 06:19:15,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-15 06:19:15,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-15 06:19:15,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-15 06:19:15,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-15 06:19:15,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26563#(<= main_~x~0 0)} is VALID [2022-04-15 06:19:15,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {26563#(<= main_~x~0 0)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26563#(<= main_~x~0 0)} is VALID [2022-04-15 06:19:15,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {26563#(<= main_~x~0 0)} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26563#(<= main_~x~0 0)} is VALID [2022-04-15 06:19:15,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {26563#(<= main_~x~0 0)} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:19:15,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:19:15,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26543#(<= 48 main_~y~0)} is VALID [2022-04-15 06:19:15,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {26543#(<= 48 main_~y~0)} assume ~y~0 < 0; {26537#false} is VALID [2022-04-15 06:19:15,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-15 06:19:15,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-15 06:19:15,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-15 06:19:15,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-15 06:19:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:15,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:19:15,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-15 06:19:15,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-15 06:19:15,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-15 06:19:15,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-15 06:19:15,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {26607#(not (< main_~y~0 0))} assume ~y~0 < 0; {26537#false} is VALID [2022-04-15 06:19:15,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26607#(not (< main_~y~0 0))} is VALID [2022-04-15 06:19:15,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:15,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:15,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:15,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {26625#(<= main_~x~0 48)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:15,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26625#(<= main_~x~0 48)} is VALID [2022-04-15 06:19:15,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-15 06:19:15,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-15 06:19:15,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-15 06:19:15,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-15 06:19:15,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26536#true} is VALID [2022-04-15 06:19:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:19:15,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837143615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:19:15,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:19:15,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:19:17,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658126452] [2022-04-15 06:19:17,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658126452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:17,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-15 06:19:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145637463] [2022-04-15 06:19:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 06:19:17,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:17,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:17,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:17,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-15 06:19:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-15 06:19:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=6160, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:19:17,919 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:30,217 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-15 06:19:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-15 06:19:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 06:19:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2022-04-15 06:19:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2022-04-15 06:19:30,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 136 transitions. [2022-04-15 06:19:30,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:30,337 INFO L225 Difference]: With dead ends: 150 [2022-04-15 06:19:30,337 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 06:19:30,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6891 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1436, Invalid=22434, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 06:19:30,339 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 85 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 6757 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 6912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 6757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:30,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 296 Invalid, 6912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 6757 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 06:19:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 06:19:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2022-04-15 06:19:30,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:30,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,864 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,864 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:30,866 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-04-15 06:19:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2022-04-15 06:19:30,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:30,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:30,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 06:19:30,866 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 06:19:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:30,868 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-04-15 06:19:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2022-04-15 06:19:30,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:30,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:30,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:30,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-15 06:19:30,870 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 124 [2022-04-15 06:19:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:30,870 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-15 06:19:30,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:30,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-15 06:19:31,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-15 06:19:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 06:19:31,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:31,045 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:31,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 06:19:31,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:31,246 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1842273789, now seen corresponding path program 39 times [2022-04-15 06:19:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:31,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037122867] [2022-04-15 06:19:31,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:31,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:31,817 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash 99098315, now seen corresponding path program 1 times [2022-04-15 06:19:31,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:31,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135464465] [2022-04-15 06:19:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:19:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:31,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-15 06:19:31,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-15 06:19:31,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-15 06:19:31,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:19:31,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-15 06:19:31,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-15 06:19:31,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-15 06:19:31,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-15 06:19:31,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27704#(= main_~x~0 0)} is VALID [2022-04-15 06:19:31,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {27704#(= main_~x~0 0)} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27704#(= main_~x~0 0)} is VALID [2022-04-15 06:19:31,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {27704#(= main_~x~0 0)} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27704#(= main_~x~0 0)} is VALID [2022-04-15 06:19:31,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {27704#(= main_~x~0 0)} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:31,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:31,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27706#(<= 48 main_~y~0)} is VALID [2022-04-15 06:19:31,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {27706#(<= 48 main_~y~0)} assume ~y~0 < 0; {27700#false} is VALID [2022-04-15 06:19:31,887 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-15 06:19:31,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-15 06:19:31,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-15 06:19:31,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-15 06:19:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135464465] [2022-04-15 06:19:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135464465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:19:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142191365] [2022-04-15 06:19:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:31,893 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:19:31,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:19:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:31,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:19:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:31,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:32,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27699#true} is VALID [2022-04-15 06:19:32,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-15 06:19:32,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-15 06:19:32,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-15 06:19:32,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-15 06:19:32,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:32,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:32,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:32,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:19:32,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:19:32,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27743#(<= 49 main_~y~0)} is VALID [2022-04-15 06:19:32,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {27743#(<= 49 main_~y~0)} assume ~y~0 < 0; {27700#false} is VALID [2022-04-15 06:19:32,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-15 06:19:32,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-15 06:19:32,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-15 06:19:32,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-15 06:19:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:32,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:19:32,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-15 06:19:32,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-15 06:19:32,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-15 06:19:32,567 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-15 06:19:32,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {27771#(not (< main_~y~0 0))} assume ~y~0 < 0; {27700#false} is VALID [2022-04-15 06:19:32,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27771#(not (< main_~y~0 0))} is VALID [2022-04-15 06:19:32,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:32,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:32,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:32,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {27789#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:32,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27789#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:19:32,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-15 06:19:32,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-15 06:19:32,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-15 06:19:32,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-15 06:19:32,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27699#true} is VALID [2022-04-15 06:19:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:19:32,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142191365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:19:32,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:19:32,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:19:35,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:35,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037122867] [2022-04-15 06:19:35,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037122867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:35,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:35,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-15 06:19:35,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017596247] [2022-04-15 06:19:35,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 06:19:35,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:35,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:35,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:35,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-15 06:19:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-15 06:19:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=6678, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:19:35,158 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:47,115 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2022-04-15 06:19:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-15 06:19:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 06:19:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 139 transitions. [2022-04-15 06:19:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 139 transitions. [2022-04-15 06:19:47,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 139 transitions. [2022-04-15 06:19:47,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:47,253 INFO L225 Difference]: With dead ends: 153 [2022-04-15 06:19:47,253 INFO L226 Difference]: Without dead ends: 138 [2022-04-15 06:19:47,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7424 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1405, Invalid=24035, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 06:19:47,255 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6884 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 6884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:47,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 102 Invalid, 7070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 6884 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 06:19:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-15 06:19:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-04-15 06:19:47,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:47,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,854 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,854 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:47,855 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-04-15 06:19:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-15 06:19:47,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:47,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:47,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-15 06:19:47,856 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-15 06:19:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:47,858 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-04-15 06:19:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-15 06:19:47,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:47,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:47,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:47,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2022-04-15 06:19:47,860 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 127 [2022-04-15 06:19:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:47,860 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2022-04-15 06:19:47,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:47,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 141 transitions. [2022-04-15 06:19:48,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2022-04-15 06:19:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:19:48,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:48,160 INFO L499 BasicCegarLoop]: trace histogram [40, 39, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:48,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 06:19:48,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 06:19:48,360 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash 499962279, now seen corresponding path program 40 times [2022-04-15 06:19:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:48,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034861582] [2022-04-15 06:19:48,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:49,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:19:49,039 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1690484789, now seen corresponding path program 1 times [2022-04-15 06:19:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:49,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767941059] [2022-04-15 06:19:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:19:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:49,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-15 06:19:49,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-15 06:19:49,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-15 06:19:49,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:19:49,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-15 06:19:49,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-15 06:19:49,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-15 06:19:49,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-15 06:19:49,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28892#(= main_~x~0 0)} is VALID [2022-04-15 06:19:49,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {28892#(= main_~x~0 0)} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28892#(= main_~x~0 0)} is VALID [2022-04-15 06:19:49,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {28892#(= main_~x~0 0)} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28892#(= main_~x~0 0)} is VALID [2022-04-15 06:19:49,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {28892#(= main_~x~0 0)} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:49,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:49,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28894#(<= 48 main_~y~0)} is VALID [2022-04-15 06:19:49,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {28894#(<= 48 main_~y~0)} assume ~y~0 < 0; {28888#false} is VALID [2022-04-15 06:19:49,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-15 06:19:49,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-15 06:19:49,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-15 06:19:49,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-15 06:19:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767941059] [2022-04-15 06:19:49,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767941059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:19:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861393467] [2022-04-15 06:19:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:49,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:49,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:49,128 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:19:49,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:19:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:49,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:19:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:49,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:49,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28887#true} is VALID [2022-04-15 06:19:49,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-15 06:19:49,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-15 06:19:49,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-15 06:19:49,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-15 06:19:49,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:49,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:49,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:19:49,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:19:49,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:19:49,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28931#(<= 49 main_~y~0)} is VALID [2022-04-15 06:19:49,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {28931#(<= 49 main_~y~0)} assume ~y~0 < 0; {28888#false} is VALID [2022-04-15 06:19:49,596 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-15 06:19:49,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-15 06:19:49,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-15 06:19:49,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-15 06:19:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:19:49,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:19:50,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-15 06:19:50,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-15 06:19:50,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-15 06:19:50,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-15 06:19:50,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {28959#(not (< main_~y~0 0))} assume ~y~0 < 0; {28888#false} is VALID [2022-04-15 06:19:50,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28959#(not (< main_~y~0 0))} is VALID [2022-04-15 06:19:50,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:50,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:19:50,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:50,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {28977#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:19:50,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28977#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:19:50,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-15 06:19:50,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-15 06:19:50,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-15 06:19:50,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-15 06:19:50,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28887#true} is VALID [2022-04-15 06:19:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:19:50,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861393467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:19:50,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:19:50,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:19:53,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034861582] [2022-04-15 06:19:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034861582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:53,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:53,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-04-15 06:19:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811214213] [2022-04-15 06:19:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 06:19:53,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:53,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:19:53,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:53,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-04-15 06:19:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-04-15 06:19:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=7008, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:19:53,181 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:05,889 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2022-04-15 06:20:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-15 06:20:05,889 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 06:20:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:20:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 142 transitions. [2022-04-15 06:20:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 142 transitions. [2022-04-15 06:20:05,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 142 transitions. [2022-04-15 06:20:06,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:06,019 INFO L225 Difference]: With dead ends: 156 [2022-04-15 06:20:06,020 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 06:20:06,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7814 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1442, Invalid=25290, Unknown=0, NotChecked=0, Total=26732 [2022-04-15 06:20:06,021 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7383 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 7383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:20:06,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 328 Invalid, 7545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 7383 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 06:20:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 06:20:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2022-04-15 06:20:06,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:20:06,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:06,627 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:06,628 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:06,629 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-15 06:20:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-15 06:20:06,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:06,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:06,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 06:20:06,630 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 06:20:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:06,633 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-15 06:20:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-15 06:20:06,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:06,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:06,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:20:06,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:20:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-15 06:20:06,644 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 130 [2022-04-15 06:20:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:20:06,646 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-15 06:20:06,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:06,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-15 06:20:06,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-15 06:20:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 06:20:06,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:20:06,879 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:20:06,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:20:07,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 06:20:07,080 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:20:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:20:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2015973251, now seen corresponding path program 41 times [2022-04-15 06:20:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:07,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039542711] [2022-04-15 06:20:11,248 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:20:11,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:15,537 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:20:15,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:15,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:20:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash 814899403, now seen corresponding path program 1 times [2022-04-15 06:20:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:20:15,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364166611] [2022-04-15 06:20:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:20:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:20:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:15,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-15 06:20:15,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-15 06:20:15,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-15 06:20:15,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:20:15,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-15 06:20:15,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-15 06:20:15,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-15 06:20:15,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-15 06:20:15,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30104#(= main_~x~0 0)} is VALID [2022-04-15 06:20:15,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {30104#(= main_~x~0 0)} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30104#(= main_~x~0 0)} is VALID [2022-04-15 06:20:15,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {30104#(= main_~x~0 0)} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30104#(= main_~x~0 0)} is VALID [2022-04-15 06:20:15,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {30104#(= main_~x~0 0)} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:15,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:15,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30106#(<= 48 main_~y~0)} is VALID [2022-04-15 06:20:15,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(<= 48 main_~y~0)} assume ~y~0 < 0; {30100#false} is VALID [2022-04-15 06:20:15,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-15 06:20:15,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-15 06:20:15,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-15 06:20:15,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-15 06:20:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:20:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:20:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364166611] [2022-04-15 06:20:15,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364166611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:20:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681179017] [2022-04-15 06:20:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:20:15,799 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:20:15,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 06:20:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:15,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:20:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:15,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:20:16,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30099#true} is VALID [2022-04-15 06:20:16,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-15 06:20:16,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-15 06:20:16,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-15 06:20:16,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-15 06:20:16,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:16,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:16,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:16,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:20:16,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:20:16,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30143#(<= 49 main_~y~0)} is VALID [2022-04-15 06:20:16,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {30143#(<= 49 main_~y~0)} assume ~y~0 < 0; {30100#false} is VALID [2022-04-15 06:20:16,152 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-15 06:20:16,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-15 06:20:16,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-15 06:20:16,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-15 06:20:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:20:16,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:20:16,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-15 06:20:16,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-15 06:20:16,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-15 06:20:16,629 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-15 06:20:16,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {30171#(not (< main_~y~0 0))} assume ~y~0 < 0; {30100#false} is VALID [2022-04-15 06:20:16,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30171#(not (< main_~y~0 0))} is VALID [2022-04-15 06:20:16,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:16,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:16,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:16,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {30189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:16,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:20:16,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-15 06:20:16,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-15 06:20:16,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-15 06:20:16,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-15 06:20:16,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30099#true} is VALID [2022-04-15 06:20:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:20:16,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681179017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:20:16,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:20:16,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:20:19,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:20:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039542711] [2022-04-15 06:20:19,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039542711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:20:19,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:20:19,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-15 06:20:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583497257] [2022-04-15 06:20:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:20:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 06:20:19,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:20:19,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:19,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:19,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-15 06:20:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-15 06:20:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=7346, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 06:20:19,911 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:33,593 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2022-04-15 06:20:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-15 06:20:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 06:20:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:20:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 145 transitions. [2022-04-15 06:20:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 145 transitions. [2022-04-15 06:20:33,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 145 transitions. [2022-04-15 06:20:33,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:33,727 INFO L225 Difference]: With dead ends: 159 [2022-04-15 06:20:33,727 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 06:20:33,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8214 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1479, Invalid=26577, Unknown=0, NotChecked=0, Total=28056 [2022-04-15 06:20:33,729 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7680 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 7680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:20:33,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 159 Invalid, 7871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 7680 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 06:20:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 06:20:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2022-04-15 06:20:34,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:20:34,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:34,363 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:34,363 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:34,364 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-15 06:20:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:20:34,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:34,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:34,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-15 06:20:34,365 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-15 06:20:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:34,367 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-15 06:20:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:20:34,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:34,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:34,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:20:34,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:20:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2022-04-15 06:20:34,369 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 133 [2022-04-15 06:20:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:20:34,370 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2022-04-15 06:20:34,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:34,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 147 transitions. [2022-04-15 06:20:34,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2022-04-15 06:20:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 06:20:34,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:20:34,601 INFO L499 BasicCegarLoop]: trace histogram [42, 41, 40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:20:34,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 06:20:34,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 06:20:34,801 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:20:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:20:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -377244633, now seen corresponding path program 42 times [2022-04-15 06:20:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:34,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740461667] [2022-04-15 06:20:35,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:35,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:35,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:20:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -974683701, now seen corresponding path program 1 times [2022-04-15 06:20:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:20:35,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251690358] [2022-04-15 06:20:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:20:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:20:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:35,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-15 06:20:35,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-15 06:20:35,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-15 06:20:35,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:20:35,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-15 06:20:35,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-15 06:20:35,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-15 06:20:35,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-15 06:20:35,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31340#(= main_~x~0 0)} is VALID [2022-04-15 06:20:35,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {31340#(= main_~x~0 0)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31340#(= main_~x~0 0)} is VALID [2022-04-15 06:20:35,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {31340#(= main_~x~0 0)} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31340#(= main_~x~0 0)} is VALID [2022-04-15 06:20:35,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {31340#(= main_~x~0 0)} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:35,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:35,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31342#(<= 48 main_~y~0)} is VALID [2022-04-15 06:20:35,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {31342#(<= 48 main_~y~0)} assume ~y~0 < 0; {31336#false} is VALID [2022-04-15 06:20:35,456 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-15 06:20:35,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-15 06:20:35,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-15 06:20:35,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-15 06:20:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:20:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:20:35,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251690358] [2022-04-15 06:20:35,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251690358] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:20:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493708888] [2022-04-15 06:20:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:20:35,458 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:20:35,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 06:20:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:35,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:20:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:35,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:20:35,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31335#true} is VALID [2022-04-15 06:20:35,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-15 06:20:35,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-15 06:20:35,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-15 06:20:35,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-15 06:20:35,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31362#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:35,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {31362#(<= main_~x~0 0)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31362#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:35,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {31362#(<= main_~x~0 0)} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31362#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:35,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {31362#(<= main_~x~0 0)} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:20:35,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:20:35,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31342#(<= 48 main_~y~0)} is VALID [2022-04-15 06:20:35,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {31342#(<= 48 main_~y~0)} assume ~y~0 < 0; {31336#false} is VALID [2022-04-15 06:20:35,713 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-15 06:20:35,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-15 06:20:35,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-15 06:20:35,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-15 06:20:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:20:35,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:20:36,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-15 06:20:36,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-15 06:20:36,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-15 06:20:36,180 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-15 06:20:36,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {31406#(not (< main_~y~0 0))} assume ~y~0 < 0; {31336#false} is VALID [2022-04-15 06:20:36,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31406#(not (< main_~y~0 0))} is VALID [2022-04-15 06:20:36,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:36,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:36,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:36,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {31424#(<= main_~x~0 48)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:36,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31424#(<= main_~x~0 48)} is VALID [2022-04-15 06:20:36,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-15 06:20:36,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-15 06:20:36,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-15 06:20:36,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-15 06:20:36,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31335#true} is VALID [2022-04-15 06:20:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:20:36,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493708888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:20:36,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:20:36,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:20:39,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:20:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740461667] [2022-04-15 06:20:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740461667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:20:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:20:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2022-04-15 06:20:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040749251] [2022-04-15 06:20:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:20:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-15 06:20:39,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:20:39,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:39,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:39,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-04-15 06:20:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-04-15 06:20:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=7476, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:20:39,495 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:53,926 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2022-04-15 06:20:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-15 06:20:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-15 06:20:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:20:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 148 transitions. [2022-04-15 06:20:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 148 transitions. [2022-04-15 06:20:53,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 148 transitions. [2022-04-15 06:20:54,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:54,041 INFO L225 Difference]: With dead ends: 162 [2022-04-15 06:20:54,041 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 06:20:54,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8455 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1592, Invalid=27478, Unknown=0, NotChecked=0, Total=29070 [2022-04-15 06:20:54,043 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 93 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 8182 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 8360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 8182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:20:54,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 295 Invalid, 8360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 8182 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 06:20:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 06:20:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-04-15 06:20:54,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:20:54,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:54,595 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:54,595 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:54,597 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2022-04-15 06:20:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2022-04-15 06:20:54,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:54,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:54,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-15 06:20:54,597 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-15 06:20:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:54,598 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2022-04-15 06:20:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2022-04-15 06:20:54,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:54,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:54,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:20:54,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:20:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-15 06:20:54,600 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 136 [2022-04-15 06:20:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:20:54,600 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-15 06:20:54,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:54,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-15 06:20:54,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-15 06:20:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 06:20:54,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:20:54,803 INFO L499 BasicCegarLoop]: trace histogram [43, 42, 41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:20:54,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 06:20:55,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:55,010 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:20:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:20:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -274113277, now seen corresponding path program 43 times [2022-04-15 06:20:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:55,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622036546] [2022-04-15 06:20:55,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:55,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:20:55,497 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:20:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1530700491, now seen corresponding path program 1 times [2022-04-15 06:20:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:20:55,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25705055] [2022-04-15 06:20:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:20:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:20:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:55,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-15 06:20:55,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-15 06:20:55,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-15 06:20:55,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:20:55,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-15 06:20:55,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-15 06:20:55,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-15 06:20:55,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-15 06:20:55,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32599#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:20:55,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {32599#(and (= main_~x~0 0) (= main_~y~0 0))} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:55,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:55,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:55,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:20:55,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32602#(<= 49 main_~y~0)} is VALID [2022-04-15 06:20:55,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {32602#(<= 49 main_~y~0)} assume ~y~0 < 0; {32595#false} is VALID [2022-04-15 06:20:55,567 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-15 06:20:55,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-15 06:20:55,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-15 06:20:55,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-15 06:20:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:20:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:20:55,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25705055] [2022-04-15 06:20:55,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25705055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:20:55,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842998996] [2022-04-15 06:20:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:20:55,572 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:20:55,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 06:20:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:55,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:20:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:55,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:20:55,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32594#true} is VALID [2022-04-15 06:20:55,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-15 06:20:55,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-15 06:20:55,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-15 06:20:55,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-15 06:20:55,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32622#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:55,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {32622#(<= main_~x~0 0)} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32622#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:55,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {32622#(<= main_~x~0 0)} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32622#(<= main_~x~0 0)} is VALID [2022-04-15 06:20:55,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {32622#(<= main_~x~0 0)} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:20:55,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:20:55,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32639#(<= 48 main_~y~0)} is VALID [2022-04-15 06:20:55,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {32639#(<= 48 main_~y~0)} assume ~y~0 < 0; {32595#false} is VALID [2022-04-15 06:20:55,758 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-15 06:20:55,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-15 06:20:55,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-15 06:20:55,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-15 06:20:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:20:55,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:20:56,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-15 06:20:56,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-15 06:20:56,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-15 06:20:56,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-15 06:20:56,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {32667#(not (< main_~y~0 0))} assume ~y~0 < 0; {32595#false} is VALID [2022-04-15 06:20:56,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32667#(not (< main_~y~0 0))} is VALID [2022-04-15 06:20:56,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:56,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:20:56,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:56,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {32685#(<= main_~x~0 48)} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:20:56,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32685#(<= main_~x~0 48)} is VALID [2022-04-15 06:20:56,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-15 06:20:56,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-15 06:20:56,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-15 06:20:56,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-15 06:20:56,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32594#true} is VALID [2022-04-15 06:20:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:20:56,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842998996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:20:56,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:20:56,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:20:59,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:20:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622036546] [2022-04-15 06:20:59,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622036546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:20:59,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:20:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2022-04-15 06:20:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228490305] [2022-04-15 06:20:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:20:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 06:20:59,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:20:59,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:20:59,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:59,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-15 06:20:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-15 06:20:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=8404, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:20:59,616 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:16,945 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2022-04-15 06:21:16,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-15 06:21:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 06:21:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2022-04-15 06:21:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2022-04-15 06:21:16,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 151 transitions. [2022-04-15 06:21:17,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:17,063 INFO L225 Difference]: With dead ends: 165 [2022-04-15 06:21:17,063 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 06:21:17,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4659 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1639, Invalid=30581, Unknown=0, NotChecked=0, Total=32220 [2022-04-15 06:21:17,065 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 11008 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 11178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 11008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:17,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 441 Invalid, 11178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 11008 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 06:21:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 06:21:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-15 06:21:17,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:17,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:17,656 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:17,656 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:17,657 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2022-04-15 06:21:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-15 06:21:17,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:17,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:17,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 06:21:17,658 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 06:21:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:17,659 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2022-04-15 06:21:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-15 06:21:17,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:17,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:17,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:17,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2022-04-15 06:21:17,661 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 139 [2022-04-15 06:21:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:17,661 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2022-04-15 06:21:17,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:17,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 153 transitions. [2022-04-15 06:21:17,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-15 06:21:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-15 06:21:17,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:17,862 INFO L499 BasicCegarLoop]: trace histogram [44, 43, 42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:17,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 06:21:18,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:18,063 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1210496679, now seen corresponding path program 44 times [2022-04-15 06:21:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:18,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812748609] [2022-04-15 06:21:18,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:22,393 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:21:22,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:22,533 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -258882613, now seen corresponding path program 1 times [2022-04-15 06:21:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709097449] [2022-04-15 06:21:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:22,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-15 06:21:22,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-15 06:21:22,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-15 06:21:22,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:21:22,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-15 06:21:22,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-15 06:21:22,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-15 06:21:22,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-15 06:21:22,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33889#(= main_~x~0 0)} is VALID [2022-04-15 06:21:22,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {33889#(= main_~x~0 0)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33889#(= main_~x~0 0)} is VALID [2022-04-15 06:21:22,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {33889#(= main_~x~0 0)} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33889#(= main_~x~0 0)} is VALID [2022-04-15 06:21:22,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {33889#(= main_~x~0 0)} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:21:22,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:21:22,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33891#(<= 48 main_~y~0)} is VALID [2022-04-15 06:21:22,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {33891#(<= 48 main_~y~0)} assume ~y~0 < 0; {33885#false} is VALID [2022-04-15 06:21:22,590 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-15 06:21:22,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-15 06:21:22,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-15 06:21:22,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-15 06:21:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:21:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709097449] [2022-04-15 06:21:22,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709097449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:21:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331077610] [2022-04-15 06:21:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:22,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:22,596 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:21:22,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 06:21:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:22,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:21:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:22,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:22,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33884#true} is VALID [2022-04-15 06:21:22,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-15 06:21:22,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-15 06:21:22,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-15 06:21:22,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-15 06:21:22,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33911#(<= main_~x~0 0)} is VALID [2022-04-15 06:21:22,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {33911#(<= main_~x~0 0)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33911#(<= main_~x~0 0)} is VALID [2022-04-15 06:21:22,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {33911#(<= main_~x~0 0)} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33911#(<= main_~x~0 0)} is VALID [2022-04-15 06:21:22,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {33911#(<= main_~x~0 0)} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:21:22,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:21:22,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33891#(<= 48 main_~y~0)} is VALID [2022-04-15 06:21:22,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {33891#(<= 48 main_~y~0)} assume ~y~0 < 0; {33885#false} is VALID [2022-04-15 06:21:22,769 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-15 06:21:22,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-15 06:21:22,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-15 06:21:22,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-15 06:21:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:21:22,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:21:23,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-15 06:21:23,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-15 06:21:23,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-15 06:21:23,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-15 06:21:23,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {33955#(not (< main_~y~0 0))} assume ~y~0 < 0; {33885#false} is VALID [2022-04-15 06:21:23,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33955#(not (< main_~y~0 0))} is VALID [2022-04-15 06:21:23,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:21:23,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:21:23,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:21:23,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {33973#(<= main_~x~0 48)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:21:23,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33973#(<= main_~x~0 48)} is VALID [2022-04-15 06:21:23,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-15 06:21:23,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-15 06:21:23,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-15 06:21:23,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-15 06:21:23,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33884#true} is VALID [2022-04-15 06:21:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:21:23,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331077610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:21:23,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:21:23,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:21:26,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:26,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812748609] [2022-04-15 06:21:26,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812748609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:26,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:26,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-15 06:21:26,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399832311] [2022-04-15 06:21:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2022-04-15 06:21:26,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:26,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:26,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:26,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-15 06:21:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:26,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-15 06:21:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=8182, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:21:26,187 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:39,966 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2022-04-15 06:21:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-15 06:21:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2022-04-15 06:21:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 154 transitions. [2022-04-15 06:21:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 154 transitions. [2022-04-15 06:21:39,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 154 transitions. [2022-04-15 06:21:40,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:40,082 INFO L225 Difference]: With dead ends: 168 [2022-04-15 06:21:40,082 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 06:21:40,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9297 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1670, Invalid=30192, Unknown=0, NotChecked=0, Total=31862 [2022-04-15 06:21:40,084 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 97 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8714 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 8899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 8714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:40,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 307 Invalid, 8899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 8714 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 06:21:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 06:21:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-04-15 06:21:40,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:40,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:40,668 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:40,668 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:40,669 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-15 06:21:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-15 06:21:40,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:40,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:40,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 06:21:40,670 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 06:21:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:40,671 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-15 06:21:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-15 06:21:40,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:40,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:40,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:40,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-15 06:21:40,674 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 142 [2022-04-15 06:21:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:40,674 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-15 06:21:40,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:40,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-15 06:21:40,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-15 06:21:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 06:21:40,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:40,894 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:40,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 06:21:41,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-15 06:21:41,107 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash -347518333, now seen corresponding path program 45 times [2022-04-15 06:21:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:41,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2144659425] [2022-04-15 06:21:45,240 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:21:45,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:45,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:45,578 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2048465717, now seen corresponding path program 1 times [2022-04-15 06:21:45,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:45,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681462822] [2022-04-15 06:21:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:45,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-15 06:21:45,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-15 06:21:45,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-15 06:21:45,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:21:45,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-15 06:21:45,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-15 06:21:45,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-15 06:21:45,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-15 06:21:45,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35196#(= main_~x~0 0)} is VALID [2022-04-15 06:21:45,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {35196#(= main_~x~0 0)} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35196#(= main_~x~0 0)} is VALID [2022-04-15 06:21:45,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {35196#(= main_~x~0 0)} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35196#(= main_~x~0 0)} is VALID [2022-04-15 06:21:45,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {35196#(= main_~x~0 0)} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:21:45,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:21:45,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35198#(<= 48 main_~y~0)} is VALID [2022-04-15 06:21:45,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {35198#(<= 48 main_~y~0)} assume ~y~0 < 0; {35192#false} is VALID [2022-04-15 06:21:45,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-15 06:21:45,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-15 06:21:45,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-15 06:21:45,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-15 06:21:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:21:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:45,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681462822] [2022-04-15 06:21:45,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681462822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:21:45,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36560980] [2022-04-15 06:21:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:45,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:45,639 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:21:45,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 06:21:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:45,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:21:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:45,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:45,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35191#true} is VALID [2022-04-15 06:21:45,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-15 06:21:45,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-15 06:21:45,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-15 06:21:45,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-15 06:21:45,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:21:45,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:21:45,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:21:45,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:21:45,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-15 06:21:45,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35235#(<= 49 main_~y~0)} is VALID [2022-04-15 06:21:45,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {35235#(<= 49 main_~y~0)} assume ~y~0 < 0; {35192#false} is VALID [2022-04-15 06:21:45,852 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-15 06:21:45,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-15 06:21:45,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-15 06:21:45,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-15 06:21:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:21:45,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:21:46,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-15 06:21:46,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-15 06:21:46,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-15 06:21:46,222 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-15 06:21:46,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {35263#(not (< main_~y~0 0))} assume ~y~0 < 0; {35192#false} is VALID [2022-04-15 06:21:46,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35263#(not (< main_~y~0 0))} is VALID [2022-04-15 06:21:46,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:21:46,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:21:46,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:21:46,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:21:46,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35281#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:21:46,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-15 06:21:46,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-15 06:21:46,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-15 06:21:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-15 06:21:46,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35191#true} is VALID [2022-04-15 06:21:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:21:46,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36560980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:21:46,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:21:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:21:49,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2144659425] [2022-04-15 06:21:49,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2144659425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:49,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:49,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2022-04-15 06:21:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50520984] [2022-04-15 06:21:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:49,351 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 06:21:49,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:49,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:49,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:49,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-04-15 06:21:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-04-15 06:21:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=8778, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:21:49,454 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:04,027 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2022-04-15 06:22:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-15 06:22:04,027 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 06:22:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 157 transitions. [2022-04-15 06:22:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 157 transitions. [2022-04-15 06:22:04,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 157 transitions. [2022-04-15 06:22:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:04,147 INFO L225 Difference]: With dead ends: 171 [2022-04-15 06:22:04,147 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 06:22:04,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9914 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1627, Invalid=32045, Unknown=0, NotChecked=0, Total=33672 [2022-04-15 06:22:04,149 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 99 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9052 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 9052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:04,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 223 Invalid, 9256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 9052 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 06:22:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 06:22:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-04-15 06:22:04,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:04,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,746 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,746 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:04,747 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2022-04-15 06:22:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-15 06:22:04,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:04,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:04,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-15 06:22:04,748 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-15 06:22:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:04,749 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2022-04-15 06:22:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-15 06:22:04,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:04,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:04,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:04,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2022-04-15 06:22:04,751 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 145 [2022-04-15 06:22:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:04,751 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2022-04-15 06:22:04,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:04,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 159 transitions. [2022-04-15 06:22:04,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2022-04-15 06:22:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 06:22:04,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:04,970 INFO L499 BasicCegarLoop]: trace histogram [46, 45, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:04,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:05,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 06:22:05,171 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 538827047, now seen corresponding path program 46 times [2022-04-15 06:22:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662803752] [2022-04-15 06:22:05,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:09,542 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:22:09,654 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:09,656 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:22:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 456918475, now seen corresponding path program 1 times [2022-04-15 06:22:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226363103] [2022-04-15 06:22:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:09,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-15 06:22:09,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-15 06:22:09,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-15 06:22:09,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:09,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-15 06:22:09,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-15 06:22:09,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-15 06:22:09,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-15 06:22:09,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36528#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:22:09,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {36528#(and (= main_~x~0 0) (= main_~y~0 0))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:09,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:09,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:09,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:09,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36531#(<= 0 main_~y~0)} is VALID [2022-04-15 06:22:09,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {36531#(<= 0 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-15 06:22:09,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-15 06:22:09,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-15 06:22:09,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-15 06:22:09,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-15 06:22:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:22:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:09,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226363103] [2022-04-15 06:22:09,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226363103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:09,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634130631] [2022-04-15 06:22:09,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:09,748 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:09,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 06:22:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:09,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:22:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:09,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:10,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36523#true} is VALID [2022-04-15 06:22:10,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-15 06:22:10,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-15 06:22:10,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-15 06:22:10,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-15 06:22:10,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:10,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:10,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:10,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:22:10,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:22:10,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36568#(<= 49 main_~y~0)} is VALID [2022-04-15 06:22:10,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {36568#(<= 49 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-15 06:22:10,118 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-15 06:22:10,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-15 06:22:10,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-15 06:22:10,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-15 06:22:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:22:10,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:10,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-15 06:22:10,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-15 06:22:10,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-15 06:22:10,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-15 06:22:10,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {36531#(<= 0 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-15 06:22:10,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36531#(<= 0 main_~y~0)} is VALID [2022-04-15 06:22:10,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:10,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:10,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-15 06:22:10,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {36612#(and (< main_~x~0 50) (or (< (+ main_~y~0 1) 0) (<= main_~x~0 (+ 49 main_~y~0))))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-15 06:22:10,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36612#(and (< main_~x~0 50) (or (< (+ main_~y~0 1) 0) (<= main_~x~0 (+ 49 main_~y~0))))} is VALID [2022-04-15 06:22:10,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-15 06:22:10,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-15 06:22:10,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-15 06:22:10,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-15 06:22:10,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36523#true} is VALID [2022-04-15 06:22:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:22:10,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634130631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:10,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:10,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-15 06:22:14,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662803752] [2022-04-15 06:22:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662803752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:14,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:14,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-15 06:22:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370836616] [2022-04-15 06:22:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 06:22:14,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:14,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:14,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:14,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-15 06:22:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-15 06:22:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=9148, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:22:14,323 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:33,502 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-15 06:22:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-15 06:22:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 06:22:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2022-04-15 06:22:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2022-04-15 06:22:33,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 160 transitions. [2022-04-15 06:22:33,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:33,644 INFO L225 Difference]: With dead ends: 173 [2022-04-15 06:22:33,644 INFO L226 Difference]: Without dead ends: 158 [2022-04-15 06:22:33,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1833, Invalid=34457, Unknown=0, NotChecked=0, Total=36290 [2022-04-15 06:22:33,646 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 143 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12130 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 12408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 12130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:33,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 188 Invalid, 12408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 12130 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-04-15 06:22:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-15 06:22:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-04-15 06:22:34,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:34,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:34,269 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:34,269 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:34,270 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2022-04-15 06:22:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-15 06:22:34,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:34,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:34,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-15 06:22:34,271 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-15 06:22:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:34,273 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2022-04-15 06:22:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-15 06:22:34,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:34,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:34,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:34,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2022-04-15 06:22:34,275 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 148 [2022-04-15 06:22:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:34,275 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2022-04-15 06:22:34,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:34,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 162 transitions. [2022-04-15 06:22:34,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-15 06:22:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 06:22:34,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:34,486 INFO L499 BasicCegarLoop]: trace histogram [47, 46, 45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:34,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-15 06:22:34,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 06:22:34,687 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash 195106819, now seen corresponding path program 47 times [2022-04-15 06:22:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:34,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324440271] [2022-04-15 06:22:34,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:35,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:35,164 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:22:35,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1332664629, now seen corresponding path program 1 times [2022-04-15 06:22:35,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:35,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599893418] [2022-04-15 06:22:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:35,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:35,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:35,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-15 06:22:35,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-15 06:22:35,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37886#(= main_~x~0 0)} is VALID [2022-04-15 06:22:35,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= main_~x~0 0)} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37886#(= main_~x~0 0)} is VALID [2022-04-15 06:22:35,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {37886#(= main_~x~0 0)} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37886#(= main_~x~0 0)} is VALID [2022-04-15 06:22:35,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {37886#(= main_~x~0 0)} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:35,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:35,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37888#(<= 48 main_~y~0)} is VALID [2022-04-15 06:22:35,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {37888#(<= 48 main_~y~0)} assume ~y~0 < 0; {37882#false} is VALID [2022-04-15 06:22:35,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-15 06:22:35,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-15 06:22:35,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-15 06:22:35,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-15 06:22:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:22:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599893418] [2022-04-15 06:22:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599893418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347270108] [2022-04-15 06:22:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:35,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:35,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:35,252 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:35,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 06:22:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:35,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:22:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:35,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:35,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-15 06:22:35,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-15 06:22:35,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-15 06:22:35,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-15 06:22:35,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-15 06:22:35,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:35,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:35,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:22:35,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:22:35,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:22:35,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37925#(<= 49 main_~y~0)} is VALID [2022-04-15 06:22:35,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {37925#(<= 49 main_~y~0)} assume ~y~0 < 0; {37882#false} is VALID [2022-04-15 06:22:35,533 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-15 06:22:35,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-15 06:22:35,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-15 06:22:35,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-15 06:22:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:22:35,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:35,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-15 06:22:35,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-15 06:22:35,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-15 06:22:35,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-15 06:22:35,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {37953#(not (< main_~y~0 0))} assume ~y~0 < 0; {37882#false} is VALID [2022-04-15 06:22:35,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37953#(not (< main_~y~0 0))} is VALID [2022-04-15 06:22:35,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:35,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:35,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:22:35,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {37971#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:22:35,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37971#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:22:35,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-15 06:22:35,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-15 06:22:35,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-15 06:22:35,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-15 06:22:35,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-15 06:22:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:22:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347270108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:35,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:35,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:22:39,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324440271] [2022-04-15 06:22:39,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324440271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:39,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:39,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2022-04-15 06:22:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998536058] [2022-04-15 06:22:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 06:22:39,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:39,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:39,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:39,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-04-15 06:22:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-04-15 06:22:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=9542, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 06:22:39,341 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:55,202 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2022-04-15 06:22:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-04-15 06:22:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 06:22:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 163 transitions. [2022-04-15 06:22:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 163 transitions. [2022-04-15 06:22:55,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 163 transitions. [2022-04-15 06:22:55,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:55,378 INFO L225 Difference]: With dead ends: 177 [2022-04-15 06:22:55,378 INFO L226 Difference]: Without dead ends: 162 [2022-04-15 06:22:55,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10824 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1701, Invalid=34971, Unknown=0, NotChecked=0, Total=36672 [2022-04-15 06:22:55,380 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 103 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 10098 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 10287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 10098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:55,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 390 Invalid, 10287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 10098 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 06:22:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-15 06:22:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2022-04-15 06:22:56,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:56,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:56,021 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:56,021 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:56,022 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2022-04-15 06:22:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-15 06:22:56,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:56,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:56,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states. [2022-04-15 06:22:56,023 INFO L87 Difference]: Start difference. First operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states. [2022-04-15 06:22:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:56,024 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2022-04-15 06:22:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-15 06:22:56,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:56,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:56,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:56,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2022-04-15 06:22:56,026 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 151 [2022-04-15 06:22:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:56,026 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2022-04-15 06:22:56,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:22:56,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 165 transitions. [2022-04-15 06:22:56,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-04-15 06:22:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 06:22:56,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:56,241 INFO L499 BasicCegarLoop]: trace histogram [48, 47, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:56,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:56,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:56,441 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -372171865, now seen corresponding path program 48 times [2022-04-15 06:22:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:56,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [111598568] [2022-04-15 06:22:56,712 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:56,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:56,955 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:22:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1172719563, now seen corresponding path program 1 times [2022-04-15 06:22:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117156470] [2022-04-15 06:22:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:57,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-15 06:22:57,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-15 06:22:57,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-15 06:22:57,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:57,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-15 06:22:57,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-15 06:22:57,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-15 06:22:57,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-15 06:22:57,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39266#(= main_~x~0 0)} is VALID [2022-04-15 06:22:57,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {39266#(= main_~x~0 0)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39266#(= main_~x~0 0)} is VALID [2022-04-15 06:22:57,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {39266#(= main_~x~0 0)} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39266#(= main_~x~0 0)} is VALID [2022-04-15 06:22:57,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {39266#(= main_~x~0 0)} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:57,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:22:57,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39268#(<= 48 main_~y~0)} is VALID [2022-04-15 06:22:57,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {39268#(<= 48 main_~y~0)} assume ~y~0 < 0; {39262#false} is VALID [2022-04-15 06:22:57,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-15 06:22:57,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-15 06:22:57,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-15 06:22:57,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-15 06:22:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:22:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:57,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117156470] [2022-04-15 06:22:57,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117156470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:57,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067867945] [2022-04-15 06:22:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:57,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:57,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:57,019 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:57,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 06:22:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:57,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:22:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:57,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:57,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39261#true} is VALID [2022-04-15 06:22:57,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-15 06:22:57,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-15 06:22:57,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-15 06:22:57,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-15 06:22:57,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39288#(<= main_~x~0 0)} is VALID [2022-04-15 06:22:57,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {39288#(<= main_~x~0 0)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39288#(<= main_~x~0 0)} is VALID [2022-04-15 06:22:57,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {39288#(<= main_~x~0 0)} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39288#(<= main_~x~0 0)} is VALID [2022-04-15 06:22:57,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {39288#(<= main_~x~0 0)} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:22:57,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:22:57,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39268#(<= 48 main_~y~0)} is VALID [2022-04-15 06:22:57,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {39268#(<= 48 main_~y~0)} assume ~y~0 < 0; {39262#false} is VALID [2022-04-15 06:22:57,195 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-15 06:22:57,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-15 06:22:57,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-15 06:22:57,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-15 06:22:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:22:57,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:57,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-15 06:22:57,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-15 06:22:57,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-15 06:22:57,547 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-15 06:22:57,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {39332#(not (< main_~y~0 0))} assume ~y~0 < 0; {39262#false} is VALID [2022-04-15 06:22:57,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39332#(not (< main_~y~0 0))} is VALID [2022-04-15 06:22:57,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:57,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:22:57,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:22:57,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {39350#(<= main_~x~0 48)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:22:57,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39350#(<= main_~x~0 48)} is VALID [2022-04-15 06:22:57,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-15 06:22:57,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-15 06:22:57,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-15 06:22:57,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-15 06:22:57,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39261#true} is VALID [2022-04-15 06:22:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:22:57,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067867945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:57,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 06:23:00,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:23:00,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [111598568] [2022-04-15 06:23:00,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [111598568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:00,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:00,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2022-04-15 06:23:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302509938] [2022-04-15 06:23:00,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:23:00,987 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-15 06:23:00,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:23:00,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:01,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:01,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-15 06:23:01,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:01,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-15 06:23:01,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9692, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:23:01,087 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:16,684 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-04-15 06:23:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-04-15 06:23:16,684 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-15 06:23:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:23:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 166 transitions. [2022-04-15 06:23:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 166 transitions. [2022-04-15 06:23:16,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 166 transitions. [2022-04-15 06:23:16,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:16,810 INFO L225 Difference]: With dead ends: 180 [2022-04-15 06:23:16,810 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 06:23:16,812 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11089 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1824, Invalid=36006, Unknown=0, NotChecked=0, Total=37830 [2022-04-15 06:23:16,812 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 105 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9927 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 9927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:23:16,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 116 Invalid, 10155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 9927 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 06:23:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 06:23:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2022-04-15 06:23:17,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:23:17,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:17,470 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:17,470 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:17,472 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-15 06:23:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-15 06:23:17,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:17,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:17,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 06:23:17,472 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 06:23:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:17,474 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-15 06:23:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-15 06:23:17,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:17,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:17,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:23:17,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:23:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-15 06:23:17,476 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 154 [2022-04-15 06:23:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:23:17,476 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-15 06:23:17,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:17,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-15 06:23:17,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-15 06:23:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 06:23:17,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:23:17,696 INFO L499 BasicCegarLoop]: trace histogram [49, 48, 47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:23:17,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 06:23:17,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:17,899 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:23:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:23:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash 524862851, now seen corresponding path program 49 times [2022-04-15 06:23:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336838249] [2022-04-15 06:23:22,044 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:23:22,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:23:22,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:23:22,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:23:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash -616863541, now seen corresponding path program 1 times [2022-04-15 06:23:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:23:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901611541] [2022-04-15 06:23:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:23:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:23:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:22,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-15 06:23:22,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-15 06:23:22,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-15 06:23:22,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:23:22,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-15 06:23:22,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-15 06:23:22,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-15 06:23:22,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-15 06:23:22,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:23:22,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {40669#(and (= main_~x~0 0) (= main_~y~0 0))} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:22,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:22,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:22,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:22,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40672#(<= 49 main_~y~0)} is VALID [2022-04-15 06:23:22,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {40672#(<= 49 main_~y~0)} assume ~y~0 < 0; {40665#false} is VALID [2022-04-15 06:23:22,482 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-15 06:23:22,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-15 06:23:22,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-15 06:23:22,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-15 06:23:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:23:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:23:22,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901611541] [2022-04-15 06:23:22,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901611541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:23:22,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189332691] [2022-04-15 06:23:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:22,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:23:22,488 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:23:22,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 06:23:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:22,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:23:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:22,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:23:22,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40664#true} is VALID [2022-04-15 06:23:22,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-15 06:23:22,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-15 06:23:22,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-15 06:23:22,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-15 06:23:22,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40692#(<= main_~x~0 0)} is VALID [2022-04-15 06:23:22,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {40692#(<= main_~x~0 0)} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40692#(<= main_~x~0 0)} is VALID [2022-04-15 06:23:22,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {40692#(<= main_~x~0 0)} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40692#(<= main_~x~0 0)} is VALID [2022-04-15 06:23:22,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {40692#(<= main_~x~0 0)} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:23:22,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:23:22,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40709#(<= 48 main_~y~0)} is VALID [2022-04-15 06:23:22,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {40709#(<= 48 main_~y~0)} assume ~y~0 < 0; {40665#false} is VALID [2022-04-15 06:23:22,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-15 06:23:22,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-15 06:23:22,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-15 06:23:22,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-15 06:23:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:23:22,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:23:23,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-15 06:23:23,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-15 06:23:23,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-15 06:23:23,013 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-15 06:23:23,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {40737#(not (< main_~y~0 0))} assume ~y~0 < 0; {40665#false} is VALID [2022-04-15 06:23:23,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40737#(not (< main_~y~0 0))} is VALID [2022-04-15 06:23:23,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:23:23,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:23:23,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:23:23,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {40755#(<= main_~x~0 48)} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:23:23,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40755#(<= main_~x~0 48)} is VALID [2022-04-15 06:23:23,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-15 06:23:23,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-15 06:23:23,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-15 06:23:23,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-15 06:23:23,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40664#true} is VALID [2022-04-15 06:23:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:23:23,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189332691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:23:23,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:23:23,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:23:27,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:23:27,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336838249] [2022-04-15 06:23:27,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336838249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:27,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:27,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [100] imperfect sequences [] total 100 [2022-04-15 06:23:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450162654] [2022-04-15 06:23:27,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:23:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 06:23:27,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:23:27,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:27,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:27,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-04-15 06:23:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-04-15 06:23:27,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=10744, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 06:23:27,380 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:48,912 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2022-04-15 06:23:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-15 06:23:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 06:23:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:23:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 169 transitions. [2022-04-15 06:23:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 169 transitions. [2022-04-15 06:23:48,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 169 transitions. [2022-04-15 06:23:49,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:49,042 INFO L225 Difference]: With dead ends: 183 [2022-04-15 06:23:49,042 INFO L226 Difference]: Without dead ends: 168 [2022-04-15 06:23:49,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5901 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1867, Invalid=39545, Unknown=0, NotChecked=0, Total=41412 [2022-04-15 06:23:49,044 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 105 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13924 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 14118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 13924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:23:49,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 182 Invalid, 14118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 13924 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-04-15 06:23:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-15 06:23:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2022-04-15 06:23:49,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:23:49,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:49,716 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:49,716 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:49,718 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-15 06:23:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-15 06:23:49,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:49,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:49,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 06:23:49,718 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 06:23:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:49,720 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-15 06:23:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-15 06:23:49,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:49,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:49,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:23:49,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:23:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2022-04-15 06:23:49,722 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 157 [2022-04-15 06:23:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:23:49,722 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2022-04-15 06:23:49,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:49,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 171 transitions. [2022-04-15 06:23:49,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2022-04-15 06:23:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 06:23:49,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:23:49,963 INFO L499 BasicCegarLoop]: trace histogram [50, 49, 48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:23:49,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 06:23:50,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:50,164 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:23:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:23:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash 799571495, now seen corresponding path program 50 times [2022-04-15 06:23:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:50,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128268445] [2022-04-15 06:23:50,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:23:54,563 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:23:54,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:23:54,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:23:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1888520651, now seen corresponding path program 1 times [2022-04-15 06:23:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:23:54,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264653594] [2022-04-15 06:23:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:23:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:23:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:54,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-15 06:23:54,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-15 06:23:54,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-15 06:23:54,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:23:54,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-15 06:23:54,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-15 06:23:54,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-15 06:23:54,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-15 06:23:54,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42103#(= main_~x~0 0)} is VALID [2022-04-15 06:23:54,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {42103#(= main_~x~0 0)} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42104#(<= main_~x~0 0)} is VALID [2022-04-15 06:23:54,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {42104#(<= main_~x~0 0)} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42104#(<= main_~x~0 0)} is VALID [2022-04-15 06:23:54,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {42104#(<= main_~x~0 0)} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:54,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:54,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42106#(<= 48 main_~y~0)} is VALID [2022-04-15 06:23:54,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {42106#(<= 48 main_~y~0)} assume ~y~0 < 0; {42099#false} is VALID [2022-04-15 06:23:54,748 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-15 06:23:54,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-15 06:23:54,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-15 06:23:54,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-15 06:23:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:23:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:23:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264653594] [2022-04-15 06:23:54,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264653594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:23:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339083566] [2022-04-15 06:23:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:23:54,752 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:23:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 06:23:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:54,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:23:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:54,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:23:55,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42098#true} is VALID [2022-04-15 06:23:55,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-15 06:23:55,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-15 06:23:55,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-15 06:23:55,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-15 06:23:55,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:55,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:55,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:23:55,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:23:55,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:23:55,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42143#(<= 49 main_~y~0)} is VALID [2022-04-15 06:23:55,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {42143#(<= 49 main_~y~0)} assume ~y~0 < 0; {42099#false} is VALID [2022-04-15 06:23:55,129 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-15 06:23:55,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-15 06:23:55,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-15 06:23:55,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-15 06:23:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:23:55,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:23:55,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-15 06:23:55,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-15 06:23:55,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-15 06:23:55,494 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-15 06:23:55,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {42171#(not (< main_~y~0 0))} assume ~y~0 < 0; {42099#false} is VALID [2022-04-15 06:23:55,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42171#(not (< main_~y~0 0))} is VALID [2022-04-15 06:23:55,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:23:55,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:23:55,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:23:55,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {42189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:23:55,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:23:55,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-15 06:23:55,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-15 06:23:55,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-15 06:23:55,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-15 06:23:55,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42098#true} is VALID [2022-04-15 06:23:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:23:55,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339083566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:23:55,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:23:55,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:23:59,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:23:59,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128268445] [2022-04-15 06:23:59,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128268445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:59,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:59,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2022-04-15 06:23:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831710625] [2022-04-15 06:23:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:23:59,222 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 160 [2022-04-15 06:23:59,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:23:59,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:23:59,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:59,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-04-15 06:23:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-04-15 06:23:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=10956, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 06:23:59,330 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:16,868 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2022-04-15 06:24:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-15 06:24:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 160 [2022-04-15 06:24:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:24:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 180 transitions. [2022-04-15 06:24:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 180 transitions. [2022-04-15 06:24:16,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 180 transitions. [2022-04-15 06:24:17,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:17,005 INFO L225 Difference]: With dead ends: 191 [2022-04-15 06:24:17,005 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 06:24:17,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13089 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1851, Invalid=41205, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 06:24:17,007 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11012 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 11012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:24:17,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 133 Invalid, 11263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 11012 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-15 06:24:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 06:24:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2022-04-15 06:24:17,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:24:17,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:17,722 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:17,722 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:17,724 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2022-04-15 06:24:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2022-04-15 06:24:17,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:17,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:17,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-15 06:24:17,724 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-15 06:24:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:17,726 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2022-04-15 06:24:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2022-04-15 06:24:17,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:17,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:17,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:24:17,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:24:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2022-04-15 06:24:17,728 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 160 [2022-04-15 06:24:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:24:17,728 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2022-04-15 06:24:17,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:17,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 174 transitions. [2022-04-15 06:24:17,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2022-04-15 06:24:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 06:24:17,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:24:17,969 INFO L499 BasicCegarLoop]: trace histogram [51, 50, 49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:24:17,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 06:24:18,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-15 06:24:18,171 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:24:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:24:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1562881277, now seen corresponding path program 51 times [2022-04-15 06:24:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:18,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060608665] [2022-04-15 06:24:18,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:24:18,596 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:24:18,597 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:24:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash 98937547, now seen corresponding path program 1 times [2022-04-15 06:24:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:24:18,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481340315] [2022-04-15 06:24:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:24:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:24:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:18,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-15 06:24:18,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-15 06:24:18,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-15 06:24:18,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:24:18,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-15 06:24:18,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-15 06:24:18,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-15 06:24:18,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-15 06:24:18,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43582#(= main_~x~0 0)} is VALID [2022-04-15 06:24:18,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {43582#(= main_~x~0 0)} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43582#(= main_~x~0 0)} is VALID [2022-04-15 06:24:18,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {43582#(= main_~x~0 0)} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43582#(= main_~x~0 0)} is VALID [2022-04-15 06:24:18,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {43582#(= main_~x~0 0)} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:18,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:18,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43584#(<= 48 main_~y~0)} is VALID [2022-04-15 06:24:18,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {43584#(<= 48 main_~y~0)} assume ~y~0 < 0; {43578#false} is VALID [2022-04-15 06:24:18,679 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-15 06:24:18,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-15 06:24:18,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-15 06:24:18,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-15 06:24:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:24:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:24:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481340315] [2022-04-15 06:24:18,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481340315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:24:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033837912] [2022-04-15 06:24:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:24:18,680 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:24:18,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-15 06:24:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:18,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:24:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:24:18,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43577#true} is VALID [2022-04-15 06:24:18,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-15 06:24:18,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-15 06:24:18,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-15 06:24:18,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-15 06:24:18,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:18,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:18,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:18,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:24:18,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-15 06:24:18,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43621#(<= 49 main_~y~0)} is VALID [2022-04-15 06:24:18,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {43621#(<= 49 main_~y~0)} assume ~y~0 < 0; {43578#false} is VALID [2022-04-15 06:24:18,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-15 06:24:18,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-15 06:24:18,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-15 06:24:18,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-15 06:24:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:24:18,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:24:19,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-15 06:24:19,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-15 06:24:19,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-15 06:24:19,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-15 06:24:19,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {43649#(not (< main_~y~0 0))} assume ~y~0 < 0; {43578#false} is VALID [2022-04-15 06:24:19,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43649#(not (< main_~y~0 0))} is VALID [2022-04-15 06:24:19,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:24:19,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:24:19,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:24:19,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {43667#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:24:19,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43667#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-15 06:24:19,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-15 06:24:19,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-15 06:24:19,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-15 06:24:19,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-15 06:24:19,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43577#true} is VALID [2022-04-15 06:24:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:24:19,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033837912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:24:19,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:24:19,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-15 06:24:23,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:24:23,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1060608665] [2022-04-15 06:24:23,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1060608665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:23,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:23,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2022-04-15 06:24:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583397858] [2022-04-15 06:24:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:24:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-15 06:24:23,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:24:23,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:23,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:23,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-04-15 06:24:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-04-15 06:24:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=11164, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:24:23,334 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:41,532 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-15 06:24:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-15 06:24:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-15 06:24:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:24:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 179 transitions. [2022-04-15 06:24:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 179 transitions. [2022-04-15 06:24:41,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 179 transitions. [2022-04-15 06:24:41,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:41,708 INFO L225 Difference]: With dead ends: 189 [2022-04-15 06:24:41,708 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 06:24:41,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13248 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1873, Invalid=42017, Unknown=0, NotChecked=0, Total=43890 [2022-04-15 06:24:41,718 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 114 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 11610 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 11610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:24:41,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 338 Invalid, 11834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 11610 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-04-15 06:24:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 06:24:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-04-15 06:24:42,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:24:42,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,527 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,527 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:42,529 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-15 06:24:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-15 06:24:42,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:42,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:42,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 06:24:42,529 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 06:24:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:42,531 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-15 06:24:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-15 06:24:42,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:42,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:42,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:24:42,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:24:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2022-04-15 06:24:42,533 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 163 [2022-04-15 06:24:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:24:42,533 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2022-04-15 06:24:42,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 177 transitions. [2022-04-15 06:24:42,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-15 06:24:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-15 06:24:42,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:24:42,778 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:24:42,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 06:24:42,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-15 06:24:42,978 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:24:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:24:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 235667623, now seen corresponding path program 52 times [2022-04-15 06:24:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:42,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083806880] [2022-04-15 06:24:43,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:24:43,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:24:43,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:24:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1690645557, now seen corresponding path program 1 times [2022-04-15 06:24:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:24:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167290541] [2022-04-15 06:24:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:24:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:24:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:43,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-15 06:24:43,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-15 06:24:43,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-15 06:24:43,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:24:43,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-15 06:24:43,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-15 06:24:43,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-15 06:24:43,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-15 06:24:43,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45062#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 06:24:43,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {45062#(and (= main_~x~0 0) (= main_~y~0 0))} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:43,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:43,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:43,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:24:43,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45065#(<= 49 main_~y~0)} is VALID [2022-04-15 06:24:43,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {45065#(<= 49 main_~y~0)} assume ~y~0 < 0; {45058#false} is VALID [2022-04-15 06:24:43,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-15 06:24:43,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-15 06:24:43,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-15 06:24:43,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-15 06:24:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:24:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:24:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167290541] [2022-04-15 06:24:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167290541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:24:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793141770] [2022-04-15 06:24:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:24:43,484 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:24:43,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-15 06:24:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:43,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:24:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:43,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:24:43,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45057#true} is VALID [2022-04-15 06:24:43,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-15 06:24:43,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-15 06:24:43,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-15 06:24:43,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-15 06:24:43,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45085#(<= main_~x~0 0)} is VALID [2022-04-15 06:24:43,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {45085#(<= main_~x~0 0)} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45085#(<= main_~x~0 0)} is VALID [2022-04-15 06:24:43,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {45085#(<= main_~x~0 0)} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45085#(<= main_~x~0 0)} is VALID [2022-04-15 06:24:43,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {45085#(<= main_~x~0 0)} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:24:43,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-15 06:24:43,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45102#(<= 48 main_~y~0)} is VALID [2022-04-15 06:24:43,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {45102#(<= 48 main_~y~0)} assume ~y~0 < 0; {45058#false} is VALID [2022-04-15 06:24:43,664 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-15 06:24:43,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-15 06:24:43,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-15 06:24:43,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-15 06:24:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:24:43,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:24:44,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-15 06:24:44,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-15 06:24:44,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-15 06:24:44,018 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-15 06:24:44,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {45130#(not (< main_~y~0 0))} assume ~y~0 < 0; {45058#false} is VALID [2022-04-15 06:24:44,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45130#(not (< main_~y~0 0))} is VALID [2022-04-15 06:24:44,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:24:44,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 06:24:44,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:24:44,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {45148#(<= main_~x~0 48)} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-15 06:24:44,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45148#(<= main_~x~0 48)} is VALID [2022-04-15 06:24:44,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-15 06:24:44,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-15 06:24:44,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-15 06:24:44,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-15 06:24:44,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45057#true} is VALID [2022-04-15 06:24:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:24:44,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793141770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:24:44,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:24:44,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-15 06:24:48,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:24:48,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083806880] [2022-04-15 06:24:48,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083806880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:48,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:48,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2022-04-15 06:24:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629070361] [2022-04-15 06:24:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:24:48,754 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.5) internal successors, (162), 107 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 166 [2022-04-15 06:24:48,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:24:48,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 108 states, 108 states have (on average 1.5) internal successors, (162), 107 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:48,861 WARN L143 InductivityCheck]: Transition 45268#(and (= 49 main_~y~0) (= 51 main_~x~0)) ( _ , assume !false; , 45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) ) not inductive [2022-04-15 06:24:48,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-15 06:24:49,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:49,063 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 06:24:49,067 INFO L158 Benchmark]: Toolchain (without parser) took 694833.25ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 127.8MB in the beginning and 117.8MB in the end (delta: 10.0MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2022-04-15 06:24:49,067 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory was 144.3MB in the beginning and 144.3MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:24:49,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.58ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 127.6MB in the beginning and 192.1MB in the end (delta: -64.5MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-15 06:24:49,067 INFO L158 Benchmark]: Boogie Preprocessor took 27.36ms. Allocated memory is still 219.2MB. Free memory was 192.1MB in the beginning and 190.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:24:49,067 INFO L158 Benchmark]: RCFGBuilder took 320.44ms. Allocated memory is still 219.2MB. Free memory was 190.1MB in the beginning and 179.0MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:24:49,068 INFO L158 Benchmark]: TraceAbstraction took 694255.38ms. Allocated memory was 219.2MB in the beginning and 263.2MB in the end (delta: 44.0MB). Free memory was 178.6MB in the beginning and 117.8MB in the end (delta: 60.7MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. [2022-04-15 06:24:49,068 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.14ms. Allocated memory is still 182.5MB. Free memory was 144.3MB in the beginning and 144.3MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.58ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 127.6MB in the beginning and 192.1MB in the end (delta: -64.5MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.36ms. Allocated memory is still 219.2MB. Free memory was 192.1MB in the beginning and 190.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.44ms. Allocated memory is still 219.2MB. Free memory was 190.1MB in the beginning and 179.0MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 694255.38ms. Allocated memory was 219.2MB in the beginning and 263.2MB in the end (delta: 44.0MB). Free memory was 178.6MB in the beginning and 117.8MB in the end (delta: 60.7MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 06:24:49,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...