/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:14:09,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:14:09,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:14:09,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:14:09,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:14:09,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:14:09,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:14:09,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:14:09,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:14:09,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:14:09,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:14:09,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:14:09,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:14:09,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:14:09,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:14:09,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:14:09,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:14:09,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:14:09,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:14:09,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:14:09,559 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:14:09,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:14:09,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:14:09,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:14:09,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:14:09,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:14:09,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:14:09,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:14:09,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:14:09,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:14:09,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:14:09,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:14:09,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:14:09,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:14:09,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:14:09,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:14:09,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:14:09,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:14:09,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:14:09,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:14:09,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:14:09,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:14:09,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:14:09,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:14:09,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:14:09,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:14:09,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:14:09,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:14:09,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:09,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:14:09,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:14:09,592 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:14:09,592 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:14:09,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:14:09,592 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:14:09,592 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 13:14:09,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:14:09,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:14:09,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:14:09,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:14:09,799 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:14:09,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-15 13:14:09,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eee70754/0f66b8c6fdc64e36a2fda13d70fcf4e4/FLAG129dc407a [2022-04-15 13:14:10,157 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:14:10,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-15 13:14:10,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eee70754/0f66b8c6fdc64e36a2fda13d70fcf4e4/FLAG129dc407a [2022-04-15 13:14:10,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eee70754/0f66b8c6fdc64e36a2fda13d70fcf4e4 [2022-04-15 13:14:10,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:14:10,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:14:10,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:10,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:14:10,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:14:10,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bae7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10, skipping insertion in model container [2022-04-15 13:14:10,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:14:10,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:14:10,737 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-simple/nested_2.c[730,743] [2022-04-15 13:14:10,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:10,744 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:14:10,752 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-simple/nested_2.c[730,743] [2022-04-15 13:14:10,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:10,760 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:14:10,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10 WrapperNode [2022-04-15 13:14:10,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:10,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:14:10,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:14:10,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:14:10,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:14:10,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:14:10,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:14:10,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:14:10,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (1/1) ... [2022-04-15 13:14:10,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:10,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:10,797 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 13:14:10,808 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 13:14:10,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:14:10,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:14:10,832 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:14:10,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:14:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:14:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:14:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:14:10,873 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:14:10,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:14:10,930 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:14:10,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:14:10,935 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:14:10,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:10 BoogieIcfgContainer [2022-04-15 13:14:10,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:14:10,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:14:10,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:14:10,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:14:10,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:14:10" (1/3) ... [2022-04-15 13:14:10,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277832c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:10, skipping insertion in model container [2022-04-15 13:14:10,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:10" (2/3) ... [2022-04-15 13:14:10,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277832c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:10, skipping insertion in model container [2022-04-15 13:14:10,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:10" (3/3) ... [2022-04-15 13:14:10,944 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.c [2022-04-15 13:14:10,948 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:14:10,948 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:14:10,984 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:14:10,988 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 13:14:10,989 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:14:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:14:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:11,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:11,005 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:11,005 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 1 times [2022-04-15 13:14:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:11,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099617837] [2022-04-15 13:14:11,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 2 times [2022-04-15 13:14:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:11,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153664841] [2022-04-15 13:14:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:11,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 13:14:11,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 13:14:11,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-15 13:14:11,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:11,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 13:14:11,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 13:14:11,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-15 13:14:11,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret6 := main(); {21#true} is VALID [2022-04-15 13:14:11,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {26#(= main_~a~0 0)} is VALID [2022-04-15 13:14:11,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~a~0 0)} assume !(~a~0 < 6); {22#false} is VALID [2022-04-15 13:14:11,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !(6 == ~a~0 && 6 == ~b~0); {22#false} is VALID [2022-04-15 13:14:11,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 13:14:11,227 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 13:14:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153664841] [2022-04-15 13:14:11,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153664841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:11,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:11,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:11,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099617837] [2022-04-15 13:14:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099617837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:11,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272540553] [2022-04-15 13:14:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:11,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:11,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:11,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:11,263 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,351 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 13:14:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:11,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:14:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:14:11,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 13:14:11,406 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 13:14:11,411 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:14:11,411 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:14:11,413 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 13:14:11,415 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:11,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:14:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-15 13:14:11,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:11,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,447 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,447 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,454 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:14:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:14:11,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:11,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:11,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:14:11,455 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:14:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,457 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:14:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:14:11,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:11,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:11,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:11,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 13:14:11,459 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-15 13:14:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:11,459 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 13:14:11,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 13:14:11,474 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 13:14:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 13:14:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:14:11,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:11,475 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:11,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:14:11,475 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 1 times [2022-04-15 13:14:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1161427946] [2022-04-15 13:14:11,575 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1648133595, now seen corresponding path program 1 times [2022-04-15 13:14:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:11,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395627801] [2022-04-15 13:14:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:11,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:11,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 2 times [2022-04-15 13:14:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:11,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9118427] [2022-04-15 13:14:11,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:11,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-15 13:14:11,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-15 13:14:11,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-15 13:14:11,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:11,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-15 13:14:11,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-15 13:14:11,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-15 13:14:11,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret6 := main(); {162#true} is VALID [2022-04-15 13:14:11,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {162#true} is VALID [2022-04-15 13:14:11,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume !!(~a~0 < 6);~b~0 := 0; {167#(= main_~b~0 0)} is VALID [2022-04-15 13:14:11,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(= main_~b~0 0)} assume !(~b~0 < 6); {163#false} is VALID [2022-04-15 13:14:11,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {163#false} is VALID [2022-04-15 13:14:11,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#false} assume !(~a~0 < 6); {163#false} is VALID [2022-04-15 13:14:11,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#false} assume !(6 == ~a~0 && 6 == ~b~0); {163#false} is VALID [2022-04-15 13:14:11,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-15 13:14:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9118427] [2022-04-15 13:14:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9118427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:11,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:11,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:11,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:11,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1161427946] [2022-04-15 13:14:11,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1161427946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:11,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:11,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353816737] [2022-04-15 13:14:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:11,673 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:14:11,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:11,673 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:11,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:11,682 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,727 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 13:14:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:11,727 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:14:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:11,728 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-15 13:14:11,729 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-15 13:14:11,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-04-15 13:14:11,751 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 13:14:11,752 INFO L225 Difference]: With dead ends: 23 [2022-04-15 13:14:11,752 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:14:11,753 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 13:14:11,757 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:11,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:14:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 13:14:11,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:11,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,769 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,769 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,770 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 13:14:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 13:14:11,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:11,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:11,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:14:11,770 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:14:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:11,771 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 13:14:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 13:14:11,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:11,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:11,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:11,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 13:14:11,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 13:14:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:11,773 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 13:14:11,773 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:11,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 13:14:11,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 13:14:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:14:11,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:11,791 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:11,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2022-04-15 13:14:11,791 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 1 times [2022-04-15 13:14:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:11,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819547357] [2022-04-15 13:14:11,991 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1648195099, now seen corresponding path program 1 times [2022-04-15 13:14:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:11,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487703327] [2022-04-15 13:14:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:12,013 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:12,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 2 times [2022-04-15 13:14:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875864325] [2022-04-15 13:14:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 13:14:12,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 13:14:12,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-15 13:14:12,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:12,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 13:14:12,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 13:14:12,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-15 13:14:12,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 13:14:12,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-15 13:14:12,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {286#(= main_~b~0 0)} is VALID [2022-04-15 13:14:12,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#(= main_~b~0 0)} assume !!(~b~0 < 6); {286#(= main_~b~0 0)} is VALID [2022-04-15 13:14:12,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {287#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:12,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(<= main_~b~0 1)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-15 13:14:12,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-15 13:14:12,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 13:14:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875864325] [2022-04-15 13:14:12,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875864325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125313715] [2022-04-15 13:14:12,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:12,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:12,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:12,063 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 13:14:12,081 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 13:14:12,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:12,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:12,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:14:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:12,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-15 13:14:12,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 13:14:12,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 13:14:12,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-15 13:14:12,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 13:14:12,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-15 13:14:12,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {310#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:12,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(<= main_~b~0 0)} assume !!(~b~0 < 6); {310#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:12,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {287#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:12,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(<= main_~b~0 1)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-15 13:14:12,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-15 13:14:12,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 13:14:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:12,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:12,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 13:14:12,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-15 13:14:12,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-15 13:14:12,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#(< main_~b~0 6)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-15 13:14:12,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {344#(< main_~b~0 6)} is VALID [2022-04-15 13:14:12,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(< main_~b~0 5)} assume !!(~b~0 < 6); {348#(< main_~b~0 5)} is VALID [2022-04-15 13:14:12,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {348#(< main_~b~0 5)} is VALID [2022-04-15 13:14:12,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-15 13:14:12,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 13:14:12,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-15 13:14:12,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 13:14:12,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 13:14:12,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-15 13:14:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:12,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125313715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:12,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:12,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 13:14:12,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:12,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819547357] [2022-04-15 13:14:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819547357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:12,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:12,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307432933] [2022-04-15 13:14:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:14:12,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:12,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:12,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:14:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:14:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:14:12,289 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:12,346 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 13:14:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:14:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:14:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:14:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:14:12,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 13:14:12,366 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 13:14:12,367 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:14:12,367 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:14:12,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:12,372 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:12,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:14:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 13:14:12,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:12,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,380 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,380 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:12,381 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 13:14:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 13:14:12,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:12,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:12,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:14:12,382 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:14:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:12,383 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 13:14:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 13:14:12,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:12,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:12,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:12,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 13:14:12,384 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-15 13:14:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:12,384 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 13:14:12,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:12,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 13:14:12,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 13:14:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:14:12,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:12,402 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:12,421 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 13:14:12,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:12,616 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 3 times [2022-04-15 13:14:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:12,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1555666983] [2022-04-15 13:14:12,824 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1648256603, now seen corresponding path program 1 times [2022-04-15 13:14:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:12,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906539965] [2022-04-15 13:14:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:12,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:12,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 4 times [2022-04-15 13:14:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:12,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204850362] [2022-04-15 13:14:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 13:14:12,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 13:14:12,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-15 13:14:12,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:12,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 13:14:12,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 13:14:12,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-15 13:14:12,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-15 13:14:12,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#(= main_~a~0 0)} assume !!(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#(= main_~a~0 0)} assume !!(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {506#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#(= main_~a~0 0)} assume !(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-15 13:14:12,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {507#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:12,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#(<= main_~a~0 1)} assume !(~a~0 < 6); {502#false} is VALID [2022-04-15 13:14:12,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-15 13:14:12,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-15 13:14:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:14:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204850362] [2022-04-15 13:14:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204850362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504455653] [2022-04-15 13:14:12,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:12,919 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 13:14:12,920 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 13:14:12,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:12,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:12,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:12,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:13,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2022-04-15 13:14:13,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 13:14:13,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 13:14:13,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-15 13:14:13,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-15 13:14:13,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {501#true} is VALID [2022-04-15 13:14:13,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#true} assume !!(~a~0 < 6);~b~0 := 0; {530#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:13,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(<= main_~b~0 0)} assume !!(~b~0 < 6); {530#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:13,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {537#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:13,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~b~0 1)} assume !!(~b~0 < 6); {537#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:13,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {544#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:13,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(<= main_~b~0 2)} assume !(~b~0 < 6); {502#false} is VALID [2022-04-15 13:14:13,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {502#false} is VALID [2022-04-15 13:14:13,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !(~a~0 < 6); {502#false} is VALID [2022-04-15 13:14:13,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-15 13:14:13,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-15 13:14:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:13,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:13,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-15 13:14:13,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-15 13:14:13,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !(~a~0 < 6); {502#false} is VALID [2022-04-15 13:14:13,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {502#false} is VALID [2022-04-15 13:14:13,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {572#(< main_~b~0 6)} assume !(~b~0 < 6); {502#false} is VALID [2022-04-15 13:14:13,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {576#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {572#(< main_~b~0 6)} is VALID [2022-04-15 13:14:13,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(< main_~b~0 5)} assume !!(~b~0 < 6); {576#(< main_~b~0 5)} is VALID [2022-04-15 13:14:13,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(< main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {576#(< main_~b~0 5)} is VALID [2022-04-15 13:14:13,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#(< main_~b~0 4)} assume !!(~b~0 < 6); {583#(< main_~b~0 4)} is VALID [2022-04-15 13:14:13,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#true} assume !!(~a~0 < 6);~b~0 := 0; {583#(< main_~b~0 4)} is VALID [2022-04-15 13:14:13,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {501#true} is VALID [2022-04-15 13:14:13,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-15 13:14:13,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-15 13:14:13,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-15 13:14:13,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-15 13:14:13,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2022-04-15 13:14:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504455653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:13,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:13,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 13:14:13,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1555666983] [2022-04-15 13:14:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1555666983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:13,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:13,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556986302] [2022-04-15 13:14:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:13,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:13,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:13,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:13,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:14:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:13,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:14:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:14:13,109 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:13,178 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 13:14:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:14:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:14:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 13:14:13,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 13:14:13,197 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 13:14:13,198 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:14:13,198 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:14:13,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:14:13,202 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:13,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:14:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-04-15 13:14:13,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:13,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,213 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,214 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:13,217 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 13:14:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 13:14:13,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:13,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:13,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:14:13,218 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:14:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:13,221 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 13:14:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 13:14:13,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:13,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:13,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:13,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 13:14:13,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2022-04-15 13:14:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:13,227 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 13:14:13,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:13,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 13:14:13,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 13:14:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:14:13,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:13,253 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:13,270 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 13:14:13,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 13:14:13,455 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1986231757, now seen corresponding path program 5 times [2022-04-15 13:14:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992153262] [2022-04-15 13:14:13,711 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1648318107, now seen corresponding path program 1 times [2022-04-15 13:14:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:13,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089453414] [2022-04-15 13:14:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:13,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:13,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1986231757, now seen corresponding path program 6 times [2022-04-15 13:14:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:13,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110210206] [2022-04-15 13:14:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:13,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 13:14:13,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 13:14:13,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-15 13:14:13,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:13,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 13:14:13,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 13:14:13,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-15 13:14:13,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-15 13:14:13,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {788#true} is VALID [2022-04-15 13:14:13,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#true} assume !!(~a~0 < 6);~b~0 := 0; {793#(= main_~b~0 0)} is VALID [2022-04-15 13:14:13,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(= main_~b~0 0)} assume !!(~b~0 < 6); {793#(= main_~b~0 0)} is VALID [2022-04-15 13:14:13,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {794#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:13,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#(<= main_~b~0 1)} assume !!(~b~0 < 6); {794#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:13,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {795#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {795#(<= main_~b~0 2)} assume !(~b~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#false} assume !!(~a~0 < 6);~b~0 := 0; {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#false} assume !!(~b~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {789#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#false} assume !!(~b~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#false} assume !(~b~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {789#false} is VALID [2022-04-15 13:14:13,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#false} assume !(~a~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-15 13:14:13,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-15 13:14:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:14:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:13,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110210206] [2022-04-15 13:14:13,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110210206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:13,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85426682] [2022-04-15 13:14:13,836 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:14:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:13,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:13,838 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 13:14:13,839 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 13:14:13,864 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:14:13,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:13,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:13,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:13,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2022-04-15 13:14:13,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 13:14:13,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 13:14:13,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-15 13:14:13,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-15 13:14:13,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {815#(<= main_~a~0 0)} assume !!(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(<= main_~a~0 0)} assume !!(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(<= main_~a~0 0)} assume !(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:13,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#(<= main_~a~0 1)} assume !!(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {837#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= main_~a~0 1)} assume !!(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {837#(<= main_~a~0 1)} assume !(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:13,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {837#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {859#(<= main_~a~0 2)} is VALID [2022-04-15 13:14:13,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {859#(<= main_~a~0 2)} assume !(~a~0 < 6); {789#false} is VALID [2022-04-15 13:14:13,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-15 13:14:13,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-15 13:14:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:14:13,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:14,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-15 13:14:14,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-15 13:14:14,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {875#(< main_~a~0 6)} assume !(~a~0 < 6); {789#false} is VALID [2022-04-15 13:14:14,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {879#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {875#(< main_~a~0 6)} is VALID [2022-04-15 13:14:14,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {879#(< main_~a~0 5)} assume !(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {879#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {879#(< main_~a~0 5)} assume !!(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {879#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {879#(< main_~a~0 5)} assume !!(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {879#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {901#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {879#(< main_~a~0 5)} is VALID [2022-04-15 13:14:14,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#(< main_~a~0 4)} assume !(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {901#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#(< main_~a~0 4)} assume !!(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#(< main_~a~0 4)} assume !!(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {901#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {901#(< main_~a~0 4)} is VALID [2022-04-15 13:14:14,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-15 13:14:14,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-15 13:14:14,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 13:14:14,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 13:14:14,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2022-04-15 13:14:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:14:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85426682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:14,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-15 13:14:14,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992153262] [2022-04-15 13:14:14,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992153262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:14,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:14,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:14:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710025965] [2022-04-15 13:14:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:14:14,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:14,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:14,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:14:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:14:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:14:14,071 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:14,139 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 13:14:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:14:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:14:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 13:14:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 13:14:14,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 13:14:14,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:14,165 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:14:14,165 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:14:14,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:14:14,166 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:14,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:14:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-15 13:14:14,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:14,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,178 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,178 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:14,179 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 13:14:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 13:14:14,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:14,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:14,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:14:14,179 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:14:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:14,180 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 13:14:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 13:14:14,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:14,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:14,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:14,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 13:14:14,181 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2022-04-15 13:14:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:14,181 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 13:14:14,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 13:14:14,201 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 13:14:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 13:14:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:14:14,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:14,202 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:14,218 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 13:14:14,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:14,411 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -7293261, now seen corresponding path program 7 times [2022-04-15 13:14:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:14,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927710169] [2022-04-15 13:14:14,675 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1648379611, now seen corresponding path program 1 times [2022-04-15 13:14:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:14,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376381973] [2022-04-15 13:14:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:14,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:14,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -7293261, now seen corresponding path program 8 times [2022-04-15 13:14:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344518216] [2022-04-15 13:14:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:14,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:14,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-15 13:14:14,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-15 13:14:14,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-15 13:14:14,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1151#(= main_~b~0 0)} is VALID [2022-04-15 13:14:14,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(= main_~b~0 0)} assume !!(~b~0 < 6); {1151#(= main_~b~0 0)} is VALID [2022-04-15 13:14:14,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1152#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:14,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1152#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:14,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(<= main_~b~0 3)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-15 13:14:14,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-15 13:14:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 13:14:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344518216] [2022-04-15 13:14:14,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344518216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170574169] [2022-04-15 13:14:14,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:14:14,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:14,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:14,731 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 13:14:14,732 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 13:14:14,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:14:14,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:14:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:14,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1146#true} is VALID [2022-04-15 13:14:14,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-15 13:14:14,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-15 13:14:14,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-15 13:14:14,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-15 13:14:14,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-15 13:14:14,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1177#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:14,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#(<= main_~b~0 0)} assume !!(~b~0 < 6); {1177#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:14,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1152#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:14,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1152#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:14,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:14,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(<= main_~b~0 3)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-15 13:14:14,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-15 13:14:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 13:14:14,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:14,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-15 13:14:14,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-15 13:14:14,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-15 13:14:14,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(< main_~b~0 6)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-15 13:14:14,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1277#(< main_~b~0 6)} is VALID [2022-04-15 13:14:14,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1281#(< main_~b~0 5)} assume !!(~b~0 < 6); {1281#(< main_~b~0 5)} is VALID [2022-04-15 13:14:14,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1154#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1281#(< main_~b~0 5)} is VALID [2022-04-15 13:14:14,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1154#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:14,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:14,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1153#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:14,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-15 13:14:14,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-15 13:14:14,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-15 13:14:14,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-15 13:14:14,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-15 13:14:14,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1146#true} is VALID [2022-04-15 13:14:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 13:14:14,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170574169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:14,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:14,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 13:14:14,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:14,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927710169] [2022-04-15 13:14:14,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927710169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:14,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:14,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:14:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117871402] [2022-04-15 13:14:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:14:14,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:14,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:14,959 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 13:14:14,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:14:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:14:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:14,959 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:15,067 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 13:14:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:14:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:14:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 13:14:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 13:14:15,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 13:14:15,085 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 13:14:15,086 INFO L225 Difference]: With dead ends: 48 [2022-04-15 13:14:15,086 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:14:15,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:14:15,087 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:15,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:14:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 13:14:15,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:15,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,102 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,102 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:15,103 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 13:14:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 13:14:15,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:15,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:15,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:14:15,103 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:14:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:15,104 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 13:14:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 13:14:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:15,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:15,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:15,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 13:14:15,105 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-15 13:14:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:15,106 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 13:14:15,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 13:14:15,149 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 13:14:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 13:14:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:14:15,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:15,150 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:15,167 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 13:14:15,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:15,363 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash 648956467, now seen corresponding path program 9 times [2022-04-15 13:14:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:15,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569677563] [2022-04-15 13:14:15,614 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1648441115, now seen corresponding path program 1 times [2022-04-15 13:14:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:15,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305177446] [2022-04-15 13:14:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:15,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:15,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 648956467, now seen corresponding path program 10 times [2022-04-15 13:14:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:15,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495344892] [2022-04-15 13:14:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:15,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-15 13:14:15,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-15 13:14:15,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-15 13:14:15,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:15,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-15 13:14:15,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-15 13:14:15,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-15 13:14:15,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-15 13:14:15,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-15 13:14:15,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1561#(= main_~b~0 0)} is VALID [2022-04-15 13:14:15,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(= main_~b~0 0)} assume !!(~b~0 < 6); {1561#(= main_~b~0 0)} is VALID [2022-04-15 13:14:15,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:15,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(<= main_~b~0 4)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-15 13:14:15,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-15 13:14:15,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-15 13:14:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:14:15,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:15,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495344892] [2022-04-15 13:14:15,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495344892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:15,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191500406] [2022-04-15 13:14:15,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:14:15,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:15,699 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 13:14:15,700 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 13:14:15,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:14:15,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:15,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:14:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:15,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:15,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2022-04-15 13:14:15,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-15 13:14:15,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-15 13:14:15,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-15 13:14:15,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-15 13:14:15,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-15 13:14:15,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1588#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:15,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1588#(<= main_~b~0 0)} assume !!(~b~0 < 6); {1588#(<= main_~b~0 0)} is VALID [2022-04-15 13:14:15,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {1588#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:15,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(<= main_~b~0 4)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-15 13:14:15,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-15 13:14:15,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-15 13:14:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:14:15,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-15 13:14:15,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1706#(< main_~b~0 6)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-15 13:14:15,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1565#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1706#(< main_~b~0 6)} is VALID [2022-04-15 13:14:15,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1565#(<= main_~b~0 4)} assume !!(~b~0 < 6); {1565#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:15,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:15,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:15,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:15,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1562#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:15,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2022-04-15 13:14:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 13:14:15,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191500406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:15,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:15,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 13:14:15,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569677563] [2022-04-15 13:14:15,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569677563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:15,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:15,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:14:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810448857] [2022-04-15 13:14:15,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:15,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:15,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:15,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:15,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:14:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:15,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:14:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:14:15,969 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:16,074 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 13:14:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:14:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 13:14:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 13:14:16,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 13:14:16,096 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 13:14:16,096 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:14:16,096 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:14:16,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:14:16,097 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:16,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:14:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-15 13:14:16,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:16,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,120 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,120 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:16,121 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 13:14:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 13:14:16,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:16,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:16,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:16,122 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 13:14:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:16,124 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 13:14:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 13:14:16,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:16,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:16,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:16,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 13:14:16,125 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2022-04-15 13:14:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:16,125 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 13:14:16,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:16,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 13:14:16,149 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 13:14:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 13:14:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:14:16,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:16,150 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:16,168 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 13:14:16,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-15 13:14:16,366 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 96599219, now seen corresponding path program 11 times [2022-04-15 13:14:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:16,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703348972] [2022-04-15 13:14:16,617 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1648502619, now seen corresponding path program 1 times [2022-04-15 13:14:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:16,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816216354] [2022-04-15 13:14:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:16,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:16,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 96599219, now seen corresponding path program 12 times [2022-04-15 13:14:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:16,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799261656] [2022-04-15 13:14:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:16,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-15 13:14:16,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-15 13:14:16,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-15 13:14:16,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:16,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-15 13:14:16,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-15 13:14:16,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-15 13:14:16,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-15 13:14:16,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2020#true} is VALID [2022-04-15 13:14:16,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#true} assume !!(~a~0 < 6);~b~0 := 0; {2025#(= main_~b~0 0)} is VALID [2022-04-15 13:14:16,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(= main_~b~0 0)} assume !!(~b~0 < 6); {2025#(= main_~b~0 0)} is VALID [2022-04-15 13:14:16,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {2025#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2026#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:16,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#(<= main_~b~0 1)} assume !!(~b~0 < 6); {2026#(<= main_~b~0 1)} is VALID [2022-04-15 13:14:16,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {2026#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2027#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:16,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {2027#(<= main_~b~0 2)} assume !!(~b~0 < 6); {2027#(<= main_~b~0 2)} is VALID [2022-04-15 13:14:16,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {2027#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2028#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:16,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(<= main_~b~0 3)} assume !!(~b~0 < 6); {2028#(<= main_~b~0 3)} is VALID [2022-04-15 13:14:16,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2029#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:16,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#(<= main_~b~0 4)} assume !!(~b~0 < 6); {2029#(<= main_~b~0 4)} is VALID [2022-04-15 13:14:16,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {2029#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2030#(<= main_~b~0 5)} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {2030#(<= main_~b~0 5)} assume !(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {2021#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2021#false} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {2021#false} assume !!(~a~0 < 6);~b~0 := 0; {2021#false} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-15 13:14:16,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-15 13:14:16,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {2021#false} assume !(~b~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {2021#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2021#false} is VALID [2022-04-15 13:14:16,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {2021#false} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-15 13:14:16,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-15 13:14:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 13:14:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:16,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799261656] [2022-04-15 13:14:16,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799261656] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:14:16,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438751232] [2022-04-15 13:14:16,697 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:14:16,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:16,698 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 13:14:16,699 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 13:14:16,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:14:16,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:14:16,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:14:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:16,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:16,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-15 13:14:16,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-15 13:14:16,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-15 13:14:16,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-15 13:14:16,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-15 13:14:16,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {2050#(<= main_~a~0 0)} assume !(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:16,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {2050#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {2090#(<= main_~a~0 1)} assume !(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-15 13:14:16,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {2090#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2130#(<= main_~a~0 2)} is VALID [2022-04-15 13:14:16,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {2130#(<= main_~a~0 2)} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-15 13:14:16,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-15 13:14:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-15 13:14:16,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:16,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-15 13:14:16,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-15 13:14:16,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {2146#(< main_~a~0 6)} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-15 13:14:16,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {2150#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2146#(< main_~a~0 6)} is VALID [2022-04-15 13:14:16,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {2150#(< main_~a~0 5)} assume !(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {2190#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2150#(< main_~a~0 5)} is VALID [2022-04-15 13:14:16,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {2190#(< main_~a~0 4)} assume !(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {2190#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2190#(< main_~a~0 4)} is VALID [2022-04-15 13:14:16,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-15 13:14:16,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-15 13:14:16,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-15 13:14:16,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-15 13:14:16,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-15 13:14:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-15 13:14:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438751232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:16,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-15 13:14:16,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703348972] [2022-04-15 13:14:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703348972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:16,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:14:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915292455] [2022-04-15 13:14:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:14:16,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:16,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:17,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:14:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:17,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:14:17,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:14:17,004 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:17,129 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 13:14:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:14:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:14:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-15 13:14:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-15 13:14:17,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-15 13:14:17,152 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 13:14:17,154 INFO L225 Difference]: With dead ends: 58 [2022-04-15 13:14:17,154 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:14:17,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:14:17,155 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:17,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:14:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 13:14:17,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:17,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,180 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,180 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:17,181 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 13:14:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 13:14:17,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:17,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:17,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 13:14:17,181 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 13:14:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:17,182 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 13:14:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 13:14:17,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:17,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:17,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:17,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-15 13:14:17,183 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2022-04-15 13:14:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:17,183 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-15 13:14:17,184 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-15 13:14:17,216 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 13:14:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 13:14:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:14:17,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:17,217 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:17,232 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 13:14:17,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:14:17,431 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 455642675, now seen corresponding path program 13 times [2022-04-15 13:14:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:17,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409124201] [2022-04-15 13:14:17,679 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1648564123, now seen corresponding path program 1 times [2022-04-15 13:14:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:17,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785882943] [2022-04-15 13:14:17,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:17,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:17,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {2542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-15 13:14:17,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-15 13:14:17,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-15 13:14:17,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:17,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {2542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-15 13:14:17,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-15 13:14:17,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-15 13:14:17,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret6 := main(); {2535#true} is VALID [2022-04-15 13:14:17,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2540#(= main_~a~0 0)} is VALID [2022-04-15 13:14:17,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {2540#(= main_~a~0 0)} [62] L20-3-->L20-4_primed: Formula: (or (let ((.cse0 (* 6 v_main_~a~0_Out_26))) (and (= (* 6 |v_main_#t~pre5_Out_28|) 0) (= .cse0 (* 6 v_main_~a~0_In_13)) (= .cse0 0) (< v_main_~a~0_Out_26 7) (= 6 v_main_~b~0_Out_30))) (= v_main_~a~0_In_13 v_main_~a~0_Out_26)) InVars {main_~a~0=v_main_~a~0_In_13} OutVars{main_~b~0=v_main_~b~0_Out_30, main_#t~pre4=|v_main_#t~pre4_Out_26|, main_#t~pre5=|v_main_#t~pre5_Out_28|, main_~a~0=v_main_~a~0_Out_26} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {2541#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:17,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {2541#(<= main_~a~0 0)} [61] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2536#false} is VALID [2022-04-15 13:14:17,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#false} assume !(6 == ~a~0 && 6 == ~b~0); {2536#false} is VALID [2022-04-15 13:14:17,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#false} assume !false; {2536#false} is VALID [2022-04-15 13:14:17,706 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 13:14:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785882943] [2022-04-15 13:14:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785882943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:17,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:17,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409124201] [2022-04-15 13:14:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409124201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:17,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:14:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008598897] [2022-04-15 13:14:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 13:14:17,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:17,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:17,988 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 13:14:17,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:14:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:14:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:14:17,989 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:18,652 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-04-15 13:14:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:14:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 13:14:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-15 13:14:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-15 13:14:18,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-15 13:14:18,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:18,692 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:14:18,692 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:14:18,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:14:18,693 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:18,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:14:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:14:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 13:14:18,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:18,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,735 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,736 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:18,737 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-04-15 13:14:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 13:14:18,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:18,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:18,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 13:14:18,737 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 13:14:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:18,738 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-04-15 13:14:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 13:14:18,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:18,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:18,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:18,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 13:14:18,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 39 [2022-04-15 13:14:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:18,740 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 13:14:18,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:18,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 13:14:18,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 13:14:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:14:18,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:18,784 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:18,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 13:14:18,784 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash 130610022, now seen corresponding path program 14 times [2022-04-15 13:14:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987099764] [2022-04-15 13:14:19,041 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1648625627, now seen corresponding path program 1 times [2022-04-15 13:14:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:19,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470024253] [2022-04-15 13:14:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:19,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {2971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2964#true} is VALID [2022-04-15 13:14:19,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-04-15 13:14:19,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2964#true} {2964#true} #44#return; {2964#true} is VALID [2022-04-15 13:14:19,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {2964#true} call ULTIMATE.init(); {2971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:19,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2964#true} is VALID [2022-04-15 13:14:19,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-04-15 13:14:19,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2964#true} {2964#true} #44#return; {2964#true} is VALID [2022-04-15 13:14:19,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {2964#true} call #t~ret6 := main(); {2964#true} is VALID [2022-04-15 13:14:19,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {2964#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2969#(= main_~a~0 0)} is VALID [2022-04-15 13:14:19,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2969#(= main_~a~0 0)} [64] L20-3-->L20-4_primed: Formula: (or (= v_main_~a~0_In_15 v_main_~a~0_Out_30) (let ((.cse0 (* 6 v_main_~a~0_Out_30))) (and (= 6 v_main_~b~0_Out_34) (< v_main_~a~0_Out_30 7) (= (* 6 |v_main_#t~pre5_Out_32|) 0) (= (* 6 v_main_~a~0_In_15) .cse0) (= 0 .cse0)))) InVars {main_~a~0=v_main_~a~0_In_15} OutVars{main_~b~0=v_main_~b~0_Out_34, main_#t~pre4=|v_main_#t~pre4_Out_30|, main_#t~pre5=|v_main_#t~pre5_Out_32|, main_~a~0=v_main_~a~0_Out_30} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {2970#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:19,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#(<= main_~a~0 0)} [63] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2965#false} is VALID [2022-04-15 13:14:19,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#false} assume !(6 == ~a~0 && 6 == ~b~0); {2965#false} is VALID [2022-04-15 13:14:19,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#false} assume !false; {2965#false} is VALID [2022-04-15 13:14:19,091 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 13:14:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470024253] [2022-04-15 13:14:19,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470024253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:19,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:19,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:19,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:19,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987099764] [2022-04-15 13:14:19,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987099764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:19,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:19,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:14:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128389818] [2022-04-15 13:14:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 13:14:19,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:19,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:19,533 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 13:14:19,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:14:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:14:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:14:19,534 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:20,831 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 13:14:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:14:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 13:14:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2022-04-15 13:14:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2022-04-15 13:14:20,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 70 transitions. [2022-04-15 13:14:20,882 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 13:14:20,887 INFO L225 Difference]: With dead ends: 88 [2022-04-15 13:14:20,887 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 13:14:20,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=2184, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 13:14:20,888 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:20,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 91 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 13:14:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 13:14:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 13:14:20,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:20,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,944 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,944 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:20,945 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 13:14:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 13:14:20,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:20,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:20,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 13:14:20,945 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 13:14:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:20,946 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 13:14:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 13:14:20,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:20,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:20,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:20,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-04-15 13:14:20,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 54 [2022-04-15 13:14:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:20,954 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-04-15 13:14:20,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:20,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 71 transitions. [2022-04-15 13:14:21,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 13:14:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 13:14:21,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:21,009 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:21,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 13:14:21,009 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1010753069, now seen corresponding path program 15 times [2022-04-15 13:14:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197402232] [2022-04-15 13:14:21,261 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1648687131, now seen corresponding path program 1 times [2022-04-15 13:14:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:21,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9891017] [2022-04-15 13:14:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:21,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {3503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3496#true} is VALID [2022-04-15 13:14:21,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {3496#true} assume true; {3496#true} is VALID [2022-04-15 13:14:21,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3496#true} {3496#true} #44#return; {3496#true} is VALID [2022-04-15 13:14:21,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {3496#true} call ULTIMATE.init(); {3503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:21,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {3503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3496#true} is VALID [2022-04-15 13:14:21,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {3496#true} assume true; {3496#true} is VALID [2022-04-15 13:14:21,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3496#true} {3496#true} #44#return; {3496#true} is VALID [2022-04-15 13:14:21,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {3496#true} call #t~ret6 := main(); {3496#true} is VALID [2022-04-15 13:14:21,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3496#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {3501#(= main_~a~0 0)} is VALID [2022-04-15 13:14:21,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {3501#(= main_~a~0 0)} [66] L20-3-->L20-4_primed: Formula: (or (= v_main_~a~0_In_17 v_main_~a~0_Out_34) (let ((.cse0 (* 6 v_main_~a~0_Out_34))) (and (< v_main_~a~0_Out_34 7) (= .cse0 0) (= (* 6 v_main_~a~0_In_17) .cse0) (= (* 6 |v_main_#t~pre5_Out_36|) 0) (= 6 v_main_~b~0_Out_38)))) InVars {main_~a~0=v_main_~a~0_In_17} OutVars{main_~b~0=v_main_~b~0_Out_38, main_#t~pre4=|v_main_#t~pre4_Out_34|, main_#t~pre5=|v_main_#t~pre5_Out_36|, main_~a~0=v_main_~a~0_Out_34} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {3502#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:21,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {3502#(<= main_~a~0 0)} [65] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {3497#false} is VALID [2022-04-15 13:14:21,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {3497#false} assume !(6 == ~a~0 && 6 == ~b~0); {3497#false} is VALID [2022-04-15 13:14:21,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {3497#false} assume !false; {3497#false} is VALID [2022-04-15 13:14:21,290 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 13:14:21,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9891017] [2022-04-15 13:14:21,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9891017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:21,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:21,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:21,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:21,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197402232] [2022-04-15 13:14:21,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197402232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:21,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:21,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:14:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521471554] [2022-04-15 13:14:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 13:14:21,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:21,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:21,957 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 13:14:21,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:14:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:21,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:14:21,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:14:21,958 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:24,529 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 13:14:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:14:24,529 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 13:14:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-15 13:14:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-15 13:14:24,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 85 transitions. [2022-04-15 13:14:24,598 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 13:14:24,599 INFO L225 Difference]: With dead ends: 103 [2022-04-15 13:14:24,599 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 13:14:24,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=3696, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 13:14:24,601 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:24,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 161 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 13:14:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 13:14:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 13:14:24,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:24,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,672 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,673 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:24,674 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 13:14:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 13:14:24,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:24,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:24,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 13:14:24,674 INFO L87 Difference]: Start difference. First operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 13:14:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:24,676 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 13:14:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 13:14:24,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:24,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:24,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:24,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 13:14:24,678 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 69 [2022-04-15 13:14:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:24,678 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 13:14:24,679 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:24,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 13:14:24,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 13:14:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 13:14:24,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:24,756 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:24,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 13:14:24,757 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -641553466, now seen corresponding path program 16 times [2022-04-15 13:14:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:24,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287371513] [2022-04-15 13:14:25,027 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1648748635, now seen corresponding path program 1 times [2022-04-15 13:14:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106307260] [2022-04-15 13:14:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:25,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {4146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4139#true} is VALID [2022-04-15 13:14:25,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {4139#true} assume true; {4139#true} is VALID [2022-04-15 13:14:25,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4139#true} {4139#true} #44#return; {4139#true} is VALID [2022-04-15 13:14:25,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {4139#true} call ULTIMATE.init(); {4146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:25,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {4146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4139#true} is VALID [2022-04-15 13:14:25,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {4139#true} assume true; {4139#true} is VALID [2022-04-15 13:14:25,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4139#true} {4139#true} #44#return; {4139#true} is VALID [2022-04-15 13:14:25,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {4139#true} call #t~ret6 := main(); {4139#true} is VALID [2022-04-15 13:14:25,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {4139#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {4144#(= main_~a~0 0)} is VALID [2022-04-15 13:14:25,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {4144#(= main_~a~0 0)} [68] L20-3-->L20-4_primed: Formula: (or (= v_main_~a~0_In_19 v_main_~a~0_Out_38) (let ((.cse0 (* 6 v_main_~a~0_Out_38))) (and (< v_main_~a~0_Out_38 7) (= 6 v_main_~b~0_Out_42) (= .cse0 0) (= (* 6 |v_main_#t~pre5_Out_40|) 0) (= .cse0 (* 6 v_main_~a~0_In_19))))) InVars {main_~a~0=v_main_~a~0_In_19} OutVars{main_~b~0=v_main_~b~0_Out_42, main_#t~pre4=|v_main_#t~pre4_Out_38|, main_#t~pre5=|v_main_#t~pre5_Out_40|, main_~a~0=v_main_~a~0_Out_38} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {4145#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:25,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {4145#(<= main_~a~0 0)} [67] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {4140#false} is VALID [2022-04-15 13:14:25,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {4140#false} assume !(6 == ~a~0 && 6 == ~b~0); {4140#false} is VALID [2022-04-15 13:14:25,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {4140#false} assume !false; {4140#false} is VALID [2022-04-15 13:14:25,064 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 13:14:25,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106307260] [2022-04-15 13:14:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106307260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:25,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:25,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:25,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287371513] [2022-04-15 13:14:25,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287371513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:25,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:25,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:14:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372330108] [2022-04-15 13:14:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 13:14:25,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:25,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:25,868 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 13:14:25,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:14:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:14:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1546, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:14:25,869 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:29,210 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-04-15 13:14:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 13:14:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 13:14:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 100 transitions. [2022-04-15 13:14:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 100 transitions. [2022-04-15 13:14:29,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 100 transitions. [2022-04-15 13:14:29,281 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 13:14:29,282 INFO L225 Difference]: With dead ends: 118 [2022-04-15 13:14:29,282 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 13:14:29,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=5600, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 13:14:29,284 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:29,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 13:14:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 13:14:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 13:14:29,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:29,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,380 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,380 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:29,381 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 13:14:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 13:14:29,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:29,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:29,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 13:14:29,382 INFO L87 Difference]: Start difference. First operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 13:14:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:29,383 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 13:14:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 13:14:29,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:29,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:29,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:29,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-04-15 13:14:29,385 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 84 [2022-04-15 13:14:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:29,385 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-04-15 13:14:29,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:29,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 101 transitions. [2022-04-15 13:14:29,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 13:14:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 13:14:29,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:29,468 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:29,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 13:14:29,468 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash 248749427, now seen corresponding path program 17 times [2022-04-15 13:14:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069793] [2022-04-15 13:14:29,723 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1648810139, now seen corresponding path program 1 times [2022-04-15 13:14:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:29,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56370586] [2022-04-15 13:14:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:29,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {4900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4893#true} is VALID [2022-04-15 13:14:29,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {4893#true} assume true; {4893#true} is VALID [2022-04-15 13:14:29,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4893#true} {4893#true} #44#return; {4893#true} is VALID [2022-04-15 13:14:29,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {4893#true} call ULTIMATE.init(); {4900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:29,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {4900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4893#true} is VALID [2022-04-15 13:14:29,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {4893#true} assume true; {4893#true} is VALID [2022-04-15 13:14:29,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4893#true} {4893#true} #44#return; {4893#true} is VALID [2022-04-15 13:14:29,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {4893#true} call #t~ret6 := main(); {4893#true} is VALID [2022-04-15 13:14:29,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {4893#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {4898#(= main_~a~0 0)} is VALID [2022-04-15 13:14:29,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {4898#(= main_~a~0 0)} [70] L20-3-->L20-4_primed: Formula: (or (= v_main_~a~0_In_21 v_main_~a~0_Out_42) (let ((.cse0 (* 6 v_main_~a~0_Out_42))) (and (= (* 6 |v_main_#t~pre5_Out_44|) 0) (= (* 6 v_main_~a~0_In_21) .cse0) (= 6 v_main_~b~0_Out_46) (< v_main_~a~0_Out_42 7) (= 0 .cse0)))) InVars {main_~a~0=v_main_~a~0_In_21} OutVars{main_~b~0=v_main_~b~0_Out_46, main_#t~pre4=|v_main_#t~pre4_Out_42|, main_#t~pre5=|v_main_#t~pre5_Out_44|, main_~a~0=v_main_~a~0_Out_42} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {4899#(<= main_~a~0 0)} is VALID [2022-04-15 13:14:29,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {4899#(<= main_~a~0 0)} [69] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {4894#false} is VALID [2022-04-15 13:14:29,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {4894#false} assume !(6 == ~a~0 && 6 == ~b~0); {4894#false} is VALID [2022-04-15 13:14:29,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {4894#false} assume !false; {4894#false} is VALID [2022-04-15 13:14:29,755 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 13:14:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56370586] [2022-04-15 13:14:29,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56370586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:29,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:29,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:14:30,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069793] [2022-04-15 13:14:30,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:30,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:30,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 13:14:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715922622] [2022-04-15 13:14:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 13:14:30,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:30,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:31,026 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 13:14:31,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 13:14:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 13:14:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2148, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:14:31,028 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,001 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-15 13:14:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 13:14:36,001 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 13:14:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 108 transitions. [2022-04-15 13:14:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 108 transitions. [2022-04-15 13:14:36,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 108 transitions. [2022-04-15 13:14:36,091 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 13:14:36,091 INFO L225 Difference]: With dead ends: 116 [2022-04-15 13:14:36,091 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 13:14:36,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 28 SyntacticMatches, 25 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=7896, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 13:14:36,093 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3956 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:36,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 223 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3956 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 13:14:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 13:14:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 13:14:36,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:36,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:14:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:14:36,094 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:14:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:14:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:14:36,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:36,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:14:36,094 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:14:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:36,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:14:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:14:36,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:36,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:36,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:36,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:14:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 13:14:36,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-04-15 13:14:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:36,095 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 13:14:36,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:36,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 13:14:36,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:14:36,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:36,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:14:36,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 13:14:36,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 13:14:37,323 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-15 13:14:37,324 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-15 13:14:37,324 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 29) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point L25-1(lines 25 27) the Hoare annotation is: true [2022-04-15 13:14:37,324 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse7 (= main_~b~0 4)) (.cse2 (= main_~b~0 1)) (.cse3 (= main_~a~0 4)) (.cse0 (= main_~a~0 0)) (.cse1 (= 5 main_~b~0)) (.cse8 (= 5 main_~a~0)) (.cse4 (= main_~b~0 0)) (.cse10 (= main_~a~0 1)) (.cse5 (= main_~a~0 3)) (.cse11 (= main_~b~0 3)) (.cse6 (= main_~b~0 2)) (.cse9 (= main_~a~0 2))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse4 .cse5) (and .cse6 .cse5) (and .cse7 .cse8) (and .cse0 .cse7) (and .cse2 .cse9) (and .cse0 .cse4) (and .cse1 .cse9) (and .cse10 .cse7) (and .cse10 .cse1) (and .cse7 .cse3) (and .cse1 .cse5) (and .cse10 .cse2) (and .cse0 .cse6) (and .cse1 .cse3) (and .cse6 .cse8) (and .cse2 .cse5) (and .cse7 .cse5) (and .cse4 .cse8) (and .cse0 .cse2) (and .cse10 .cse11) (and .cse10 .cse4) (and .cse7 .cse9) (and .cse6 .cse3) (and .cse2 .cse8) (and .cse4 .cse3) (and .cse11 .cse3) (and .cse0 .cse11) (and .cse11 .cse8) (and .cse1 .cse8) (and .cse4 .cse9) (and .cse10 .cse6) (and .cse11 .cse5) (and .cse11 .cse9) (and .cse6 .cse9))) [2022-04-15 13:14:37,324 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse7 (= main_~b~0 4)) (.cse9 (= main_~b~0 6)) (.cse2 (= main_~b~0 1)) (.cse3 (= main_~a~0 4)) (.cse0 (= main_~a~0 0)) (.cse1 (= 5 main_~b~0)) (.cse8 (= 5 main_~a~0)) (.cse4 (= main_~b~0 0)) (.cse11 (= main_~a~0 1)) (.cse5 (= main_~a~0 3)) (.cse12 (= main_~b~0 3)) (.cse6 (= main_~b~0 2)) (.cse10 (= main_~a~0 2))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse4 .cse5) (and .cse6 .cse5) (and .cse7 .cse8) (and .cse0 .cse9) (and .cse0 .cse7) (and .cse2 .cse10) (and .cse0 .cse4) (and .cse9 .cse11) (and .cse1 .cse10) (and .cse9 .cse8) (and .cse11 .cse7) (and .cse11 .cse1) (and .cse7 .cse3) (and .cse1 .cse5) (and .cse11 .cse2) (and .cse0 .cse6) (and .cse1 .cse3) (and .cse6 .cse8) (and .cse2 .cse5) (and .cse7 .cse5) (and .cse4 .cse8) (and .cse9 .cse3) (and .cse0 .cse2) (and .cse9 .cse10) (and .cse11 .cse12) (and .cse11 .cse4) (and .cse7 .cse10) (and .cse6 .cse3) (and .cse9 .cse5) (and .cse2 .cse8) (and .cse4 .cse3) (and .cse12 .cse3) (and .cse0 .cse12) (and .cse12 .cse8) (and .cse1 .cse8) (and .cse4 .cse10) (and .cse11 .cse6) (and .cse12 .cse5) (and .cse12 .cse10) (and .cse6 .cse10))) [2022-04-15 13:14:37,324 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 29) the Hoare annotation is: true [2022-04-15 13:14:37,325 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2022-04-15 13:14:37,325 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2022-04-15 13:14:37,325 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: false [2022-04-15 13:14:37,325 INFO L878 garLoopResultBuilder]: At program point L20-2(lines 20 24) the Hoare annotation is: (let ((.cse0 (= main_~b~0 6))) (or (and (= main_~a~0 0) .cse0) (and .cse0 (= main_~a~0 1)) (and .cse0 (= 5 main_~a~0)) (and .cse0 (= main_~a~0 4)) (and .cse0 (= main_~a~0 2)) (and .cse0 (= main_~a~0 3)))) [2022-04-15 13:14:37,325 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 24) the Hoare annotation is: (let ((.cse0 (= main_~b~0 6))) (or (and (= main_~a~0 0) .cse0) (and .cse0 (= main_~a~0 1)) (and .cse0 (= 5 main_~a~0)) (and .cse0 (= main_~a~0 6)) (and .cse0 (= main_~a~0 4)) (and .cse0 (= main_~a~0 2)) (and .cse0 (= main_~a~0 3)))) [2022-04-15 13:14:37,325 INFO L878 garLoopResultBuilder]: At program point L20-4(lines 15 29) the Hoare annotation is: (and (= main_~a~0 6) (= 5 (+ (- 1) main_~b~0))) [2022-04-15 13:14:37,327 INFO L719 BasicCegarLoop]: Path program histogram: [17, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:37,328 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:14:37,330 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:14:37,351 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 13:14:37,358 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 13:14:37,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:14:37 BoogieIcfgContainer [2022-04-15 13:14:37,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:14:37,367 INFO L158 Benchmark]: Toolchain (without parser) took 26753.59ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 122.4MB in the beginning and 181.4MB in the end (delta: -59.0MB). Peak memory consumption was 122.5MB. Max. memory is 8.0GB. [2022-04-15 13:14:37,367 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory was 138.2MB in the beginning and 138.2MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:14:37,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.38ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 122.1MB in the beginning and 184.4MB in the end (delta: -62.3MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-15 13:14:37,367 INFO L158 Benchmark]: Boogie Preprocessor took 16.50ms. Allocated memory is still 207.6MB. Free memory was 184.4MB in the beginning and 183.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:14:37,367 INFO L158 Benchmark]: RCFGBuilder took 158.06ms. Allocated memory is still 207.6MB. Free memory was 182.8MB in the beginning and 172.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:14:37,368 INFO L158 Benchmark]: TraceAbstraction took 26428.11ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 172.2MB in the beginning and 181.4MB in the end (delta: -9.1MB). Peak memory consumption was 138.2MB. Max. memory is 8.0GB. [2022-04-15 13:14:37,368 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory was 138.2MB in the beginning and 138.2MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 146.38ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 122.1MB in the beginning and 184.4MB in the end (delta: -62.3MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.50ms. Allocated memory is still 207.6MB. Free memory was 184.4MB in the beginning and 183.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 158.06ms. Allocated memory is still 207.6MB. Free memory was 182.8MB in the beginning and 172.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 26428.11ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 172.2MB in the beginning and 181.4MB in the end (delta: -9.1MB). Peak memory consumption was 138.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 901 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9937 IncrementalHoareTripleChecker+Invalid, 10193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 143 mSDtfsCounter, 9937 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 390 SyntacticMatches, 81 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4702 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=12, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 17 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 115 NumberOfFragments, 669 HoareAnnotationTreeSize, 18 FomulaSimplifications, 673 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 18 FomulaSimplificationsInter, 314 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((a == 0 && 5 == b) || (b == 1 && a == 4)) || (b == 0 && a == 3)) || (b == 2 && a == 3)) || (b == 4 && 5 == a)) || (a == 0 && b == 6)) || (a == 0 && b == 4)) || (b == 1 && a == 2)) || (a == 0 && b == 0)) || (b == 6 && a == 1)) || (5 == b && a == 2)) || (b == 6 && 5 == a)) || (a == 1 && b == 4)) || (a == 1 && 5 == b)) || (b == 4 && a == 4)) || (5 == b && a == 3)) || (a == 1 && b == 1)) || (a == 0 && b == 2)) || (5 == b && a == 4)) || (b == 2 && 5 == a)) || (b == 1 && a == 3)) || (b == 4 && a == 3)) || (b == 0 && 5 == a)) || (b == 6 && a == 4)) || (a == 0 && b == 1)) || (b == 6 && a == 2)) || (a == 1 && b == 3)) || (a == 1 && b == 0)) || (b == 4 && a == 2)) || (b == 2 && a == 4)) || (b == 6 && a == 3)) || (b == 1 && 5 == a)) || (b == 0 && a == 4)) || (b == 3 && a == 4)) || (a == 0 && b == 3)) || (b == 3 && 5 == a)) || (5 == b && 5 == a)) || (b == 0 && a == 2)) || (a == 1 && b == 2)) || (b == 3 && a == 3)) || (b == 3 && a == 2)) || (b == 2 && a == 2) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((a == 0 && b == 6) || (b == 6 && a == 1)) || (b == 6 && 5 == a)) || (b == 6 && a == 6)) || (b == 6 && a == 4)) || (b == 6 && a == 2)) || (b == 6 && a == 3) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 13:14:37,406 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...